RECOMB 1998 Proceedings

New York, NY, United States, March 22-25, 1998

PC Chair: Pavel Pevzner
Organization Committee: Gary Benson (chair), Craig Benham, Martin Farach, Eugene Kolker
Keynote Speakers: Ruben Abagyan, Charles Cantor, David Cox, Ron Davis, Klaus Gubernator, Joshua Lederberg, Michael Levitt, David Schwartz, John Yates

List of Publications

  • Detecting non-adjoining correlations with signals in DNA. Pankaj Agarwal, Vineet Bafna.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 2–8. Association for Computing Machinery, New York, NY, USA.
  • From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution. Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 9–19. Association for Computing Machinery, New York, NY, USA.
  • An algorithm for finding tandem repeats of unspecified pattern size. Gary Benson.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 20–29. Association for Computing Machinery, New York, NY, USA.
  • Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete. Bonnie Berger, Tom Leighton.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 30–39. Association for Computing Machinery, New York, NY, USA.
  • Better methods for solving parsimony and compatibility. Maria Bonet, Mike Steel, Tandy Warnow, Shibu Yooseph.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 40–49. Association for Computing Machinery, New York, NY, USA.
  • The hierarchical organization of molecular structure computations. Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altman.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 51–59. Association for Computing Machinery, New York, NY, USA.
  • On the complexity of protein folding. Pierluigi Crescenzi, Deborah Goldman, Christos Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 61–62. Association for Computing Machinery, New York, NY, USA.
  • Constructing maps using the span and inclusion relations. Dan Fasulo, Tao Jiang, Richard M. Karp, Nitin Sharma.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 64–73. Association for Computing Machinery, New York, NY, USA.
  • How fast a protein chain can fold to its most stable structure?. Alexei V. Finkelstein, Azat Ya. Badretdinov.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 74–78. Association for Computing Machinery, New York, NY, USA.
  • A formally exact method to numerically analyze local denaturation in superhelical DNA. Richard M. Fye, Craig J. Benhan.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 79–84. Association for Computing Machinery, New York, NY, USA.
  • Algorithmic determination of core positions in the VL and VH domains of immunoglobulin molecules. Israel Gelfand, Alexander Kister, Casimir Kulikowski, Ognyan Stoyanov.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 85–93. Association for Computing Machinery, New York, NY, USA.
  • Family-based homology detection via pairwise sequence comparison. William Noble Grundy.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 94–100. Association for Computing Machinery, New York, NY, USA.
  • Dynamic programming alignment accuracy. Ian Holmes, Richard Durbin.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 102–108. Association for Computing Machinery, New York, NY, USA.
  • Optimal detection of sequence similarity by local alignment. Terence Hwa, Michael Lässig.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 109–116. Association for Computing Machinery, New York, NY, USA.
  • Algorithms for optical mapping. Richard M. Karp, Ron Shamir.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 117–124. Association for Computing Machinery, New York, NY, USA.
  • The ordinal quartet method. Paul E. Kearney.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 125–134. Association for Computing Machinery, New York, NY, USA.
  • Genome analysis using clusters of orthologous groups (COGs). Eugene V. Koonin, Roman L. Tatusov, Michael Y. Galperin, Michael N. Rosanov.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 135–139. Association for Computing Machinery, New York, NY, USA.
  • Beyond mutation matrices: physical-chemistry based evolutionary models. Jeffrey M. Koshi, David P. Mindell, Richard A. Goldstein.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 140–145. Association for Computing Machinery, New York, NY, USA.
  • Estimation for restriction sites observed by optical mapping using reversible-jump Markov chain Monte Carlo. Jae K. Lee, Vlado Dančík, Michael S. Waterman.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 147–152. Association for Computing Machinery, New York, NY, USA.
  • A polyhedral approach to RNA sequence structure alignment. Hans-Peter Lenhof, Knut Reinert, Martin Vingron.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 153–162. Association for Computing Machinery, New York, NY, USA.
  • Assessment of ab initio protein structure prediction. Arthur M. Lesk.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 163–171. Association for Computing Machinery, New York, NY, USA.
  • A structure based similarity measure for nucleic acid sequence comparison. Rongxiang Liu, Tom W. Blackwell, David U. States.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 173–181. Association for Computing Machinery, New York, NY, USA.
  • On reconstructing species trees from gene trees in term of duplications and losses. Bin Ma, Ming Li, Louxin Zhang.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 182–191. Association for Computing Machinery, New York, NY, USA.
  • Partitioning K clones: hardness results and practical algorithms for the K-populations problem. Laxmi Parida, Bud Mishra.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 192–201. Association for Computing Machinery, New York, NY, USA.
  • Estimation of allele frequencies from color-multiplexed electropherograms. David G. Politte, David R. Maffitt, David J. States.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 202–206. Association for Computing Machinery, New York, NY, USA.
  • A unified approach to word statistics. Mireille Régnier.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 207–213. Association for Computing Machinery, New York, NY, USA.
  • A self-consistent field optimization approach to build energetically and geometrically correct lattice models of proteins. Boris A. Reva, Alexei V. Finkelstein, Jeffrey Skolnick.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 214–220. Association for Computing Machinery, New York, NY, USA.
  • Motif discovery without alignment or enumeration. Isidore Rigoutsos, Aris Floratos.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 221–227. Association for Computing Machinery, New York, NY, USA.
  • An algorithm for finding novel gapped motifs in DNA sequences. Emily Rocke, Martin Tompa.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 228–233. Association for Computing Machinery, New York, NY, USA.
  • Identifying satellites in nucleic acid sequences. Marie-France Sagot, Eugene W. Myers.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 234–242. Association for Computing Machinery, New York, NY, USA.
  • Multiple genome rearrangements. David Sankoff, Mathieu Blanchette.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 243–247. Association for Computing Machinery, New York, NY, USA.
  • Modeling DNA shuffling. Fengzhu Sun.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 251–257. Association for Computing Machinery, New York, NY, USA.
  • Analysis of the position dependent amino acid probabilities and its application to the search for remote homologues. Shamil R. Sunyaev, Igor V. Rodchnkov, Frank Eisenhaber, Eugene N. Kuznetsov.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 258–265. Association for Computing Machinery, New York, NY, USA.
  • Maxwell demon and topology simplification by type II topoisomerases. Alexander Vologodskii.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 266–269. Association for Computing Machinery, New York, NY, USA.
  • The theoretical limits of DNA sequence discrimination of polyamides. Wynn L. Walker, David S. Goodsell, Elliot M. Landaw.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 270–275. Association for Computing Machinery, New York, NY, USA.
  • Regression analysis of multiple protein structures. Thomas D. Wu, Trevor Hastie, Scott C. Schmidler, Douglas L. Brutlag.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 276–284. Association for Computing Machinery, New York, NY, USA.
  • A new method for modeling and solving the protein fold recognition problem. Ying Xu, Dong Xu, Edward C. Uberbacher.
    • Proceedings: Research in Computational Molecular Biology. RECOMB 1998, pp 285–292. Association for Computing Machinery, New York, NY, USA.