RECOMB 1997 Proceedings

Santa Fe, NM, United States, January 20-23, 1997

PC Chair: Michael Waterman
Organization Committee: Sorin Istrail (chair), Bonnie Berger, Chris Fields, William Hart, Sylvia Spengler
Keynote Speakers: Rich Roberts, Eric Lander, Robert Lipshutz, David Botstein, Sam Karlin, Martin Karplus, Jonathan King, Temple Smith, Terry Speed

List of Publications

• Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. Richa Agarwala, Serafim Batzoglou, Vlado Dančík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, Steven Skiena.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 1–2. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267522
• On the approximation of protein threading. Tatsuya Akutsu, Satoru Miyano.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 3–8. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267523
• ReAligner: a program for refining DNA sequence multi-alignments. Eric L. Anson, Eugene W. Myers.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 9–16. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267524
• On constructing radiation hybrid maps. Amir Ben-Dor, Benny Chor.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 17–26. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267525
• Sequence alignment with tandem duplication. Gary Benson.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 27–36. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267526
• An iterative method for improved protein structural motif recognition. Bonnie Berger, Mona Singh.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 37–46. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267527
• Chain growth algorithms for HP-type lattice proteins. Erich Bornberg-Bauer.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 47–55. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267528
• Fabricating arrays of strings. J. Richard Bradley, Steven S. Skiena.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 57–66. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267529
• The power of surface-based DNA computation. Weiping Cai, Anne E. Condon, Robert M. Corn, Elton Glaser, Zhengdong Fei, Tony Frutos, Zhen Guo, Max G. Lagally, Qinghua Liu, Lloyd M. Smith, Andrew Thiel.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 67–74. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267530
• Sorting by reversals is difficult. Alberto Caprara.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 75–83. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267531
• A branch-and-cut approach to physical mapping with end-probes. Thomas Christof, Michael Jünger, John Kececioglu, Petra Mutzel, Gerhard Reinelt.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 84–92. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267532
• Monte Carlo sequence alignment. Gary A. Churchill.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 93–97. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267534
• Numerical taxonomy on data: experimental results. Jaime Cohen, Martin Farach.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 98. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267535
• On the complexity and approximation of syntenic distance. B. DasGupta, T. Jiang, S. Kannan, M. Li, Z. Sweedyk.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 99–108. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267536
• Protein structure prediction and potential energy landscape analysis using continuous global minimization. Ken A. Dill, Andrew T. Phillips, J. Ben Rosen.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 109–117. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267537
• An algorithmic approach to multiple complete digest mapping. Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben Settergren, Edward C. Thayer.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 118–127. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267538
• On the computational complexity of sequence design problems. William E. Hart.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 128–136. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267539
• Lattice and off-lattice side chain models of protein folding: linear time structure prediction better than 86% of optimal. William E. Hart, Sorin Istrail.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 137–146. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267540
• The application of Markov chain Monte Carlo methods to radiation hybrid mapping. S. C. Heath.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 147–150. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267541
• Algorithms for computing and integrating physical maps using unique probes. Mudita Jain, Eugene W. Myers.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 151–161. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267542
• Mapping clones with a given ordering or interleaving. Tao Jiang, Richard M. Karp.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 162. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267543
• Faster and simpler algorithm for sorting signed permutations by reversals. Haim Kaplan, Ron Shamir, Robert E. Tarjan.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 163. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267544
• Chimeric alignment by dynamic programming: algorithm and biological uses. George A. Komatsoulis, Michael S. Waterman.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 174–180. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267546
• New contact measures for the protein docking problem. Hans-Peter Lenhof.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 182–191. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267547
• An algorithm for haplotype analysis. Shili Lin, Terence P. Speed.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 192–200. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267548
• Supervised learning of hidden Markov models for sequence discrimination. Hiroshi Mamitsuka.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 202–208. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267551
• Towards constructing physical maps by optical mapping: an effective, simple, combinatorial approach. S. Muthukrishnan, Laxmi Parida.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 209–219. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267552
• Progressive multiple alignment with constraints. Gene Myers, Sanford Selznick, Zheng Zhang, Webb Miller.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 220–225. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267758
• Simulating Boolean circuits on a DNA computer. Mitsunori Ogihara, Animesh Ray.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 226–231. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267759
• Improved splice site detection in Genie. Martin G. Reese, Frank H. Eeckman, David Kulp, David Haussler.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 232–240. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267766
• A branch-and-cut algorithm for multiple sequence alignment. K. Reinert, H.-P. Lenhof, P. Mutzel, K. Mehlhorn, J. D. Kececioglu.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 1997, pp 241–250. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/267521.267845