1. RECOMB 1997: Santa Fe, NM, USA

• Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, Steven Skiena:
  Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. 1-2
  
• Tatsuya Akutsu, Satoru Miyano:
  On the approximation of protein threading. 3-8
  
• Eric L. Anson, Eugene W. Myers:
  ReAligner: a program for refining DNA sequence multi-alignments. 9-16
  
• Amir Ben-Dor, Benny Chor:
  On constructing radiation hybrid maps (extended abstract). 17-26
  
• Gary Benson:
  Sequence alignment with tandem duplication. 27-36
  
• Bonnie Berger, Mona Singh:
  An iterative method for improved protein structural motif recognition. 37-46
  
• Erich Bornberg-Bauer:
  Chain growth algorithms for HP-type lattice proteins. 47-55
  
• J. Richard Bradley, Steven Skiena:
  Fabricating arrays of strings. 57-66
  
• Weiping Cai, Anne Condon, Robert M. Corn, Elton Glaser, Zhengdong Fei, Tony Frutos, Zhen Guo, Max G. Lagally, Qinghua Liu, Lloyd M. Smith, Andrew Thiel:
  The power of surface-based DNA computation (extended abstract). 67-74
  
• Alberto Caprara:
  Sorting by reversals is difficult. 75-83
  
• Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt:
  A branch-and-cut approach to physical mapping with end-probes. 84-92
  
• Gary A. Churchill:
  Monte Carlo sequence alignment. 93-97
  
• Jaime Cohen, Martin Farach:
  Numerical taxonomy on data (abstract): experimental results. 98
  
• Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk:
  On the complexity and approximation of syntenic distance. 99-108
  
• Ken A. Dill, Andrew T. Phillips, J. Ben Rosen:
  Protein structure prediction and potential energy landscape analysis using continuous global minimization. 109-117
  
• Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben Settergren, Edward C. Thayer:
  An algorithmic approach to multiple complete digest mapping. 118-127
  
• William E. Hart:
  On the computational complexity of sequence design problems. 128-136
  
• William E. Hart, Sorin Istrail:
  Lattice and off-lattice side chain models of protein folding (extended abstract): linear time structure prediction better than 86% of optimal. 137-146
  
• S. C. Heath:
  The application of Markov chain Monte Carlo methods to radiation hybrid mapping. 147-150
  
• Mudita Jain, Eugene W. Myers:
  Algorithms for computing and integrating physical maps using unique probes. 151-161
  
• Tao Jiang, Richard M. Karp:
  Mapping clones with a given ordering or interleaving (abstract). 162
  
• Haim Kaplan, Ron Shamir, Robert Endre Tarjan:
  Faster and simpler algorithm for sorting signed permutations by reversals. 163
  
• Samuel Karlin:
  Assessing inhomogeneities in bacterial long genomic sequences. 164-171
  
• Johnathan King:
  Problems in understanding the structure and assembly of viruses (abstract). 173
  
• George A. Komatsoulis, Michael S. Waterman:
  Chimeric alignment by dynamic programming: algorithm and biological uses. 174-180
  
• Hans-Peter Lenhof:
  New contact measures for the protein docking problem. 182-191
  
• Shili Lin, Terence P. Speed:
  An algorithm for haplotype analysis. 192-200
  
• Robert J. Lipshutz:
  DNA probe arrays - accessing the genome (abstract). 201
  
• Hiroshi Mamitsuka:
  Supervised learning of hidden Markov models for sequence discrimination. 202-208
  
• S. Muthukrishnan, Laxmi Parida:
  Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. 209-219
  
• Gene Myers, Sanford Selznick, Zheng Zhang, Webb Miller:
  Progressive multiple alignment with constraints. 220-225
  
• Mitsunori Ogihara, Animesh Ray:
  Simulating Boolean circuits on a DNA computer. 226-231
  
• Martin G. Reese, Frank H. Eeckman, David Kulp, David Haussler:
  Improved splice site detection in Genie. 232-240
  
• Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu:
  A branch-and-cut algorithm for multiple sequence alignment. 241-250
  
• Richard J. Roberts:
  Hunting for new restriction enzymes in GenBank (abstract). 251
  
• David Sankoff, Vincent Ferretti, Joseph H. Nadeau:
  Conserved segment identification. 252-256
  
• Benno Schwikowski, Martin Vingron:
  The deferred path heuristic for the generalized tree alignment problem. 257-266
  
• Tetsuo Shibuya, Hiroshi Imai:
  New flexible approaches for multiple sequence alignment. 267-276
  
• Donna K. Slonim, Leonid Kruglyak, Lincoln Stein, Eric S. Lander:
  Building human genome maps with radiation hybrids. 277-286
  
• Temple F. Smith, Loredana Lo Conte, Jadwiga R. Bienkowska, Robert G. Rogers, Chrysanthe Gaitatzes, Richard H. Lathrop:
  The threading approach to the inverse protein folding problem. 287-292
  
• Terence P. Speed:
  Variations on a theme of Lander and Waterman (abstract). 293
  
• Fengzhu Sun, Gary Benson, Norman Arnheim, Michael S. Waterman:
  Pooling strategies for establishing physical genome maps using FISH. 294-299
  
• Sing-Hoi Sze, Pavel A. Pevzner:
  Las Vegas algorithms for gene recognition: suboptimal and error-tolerant spliced alignment. 300-309
  
• Lusheng Wang, Tao Jiang, Dan Gusfield:
  A more efficient approximation scheme for tree alignment. 310-319
  
• David Bruce Wilson, David S. Greenberg, Cynthia A. Phillips:
  Beyond islands (extended abstract): runs in clone-probe matrices. 320-329
  
• Ying Xu, Edward C. Uberbacher:
  Reference-based gene model prediction on DNA contigs (extended abstract). 330-336
  
• Zheng Zhang, William R. Pearson, Webb Miller:
  Aligning a DNA sequence with a protein sequence. 337-343
  
• Ralf Zimmer, Thomas Lengauer:
  Fast and numerically stable parametric alignment of biosequences. 344-353