RECOMB 2000 Proceedings

Tokyo, Japan, April 8-11, 2000

PC Chair: Ron Shamir
Organization Committee: Satoru Miyano (chair), Tatsuya Akutsu, Nir Friedman, Osamu Maruyama, Kenta Nakai, Asako Suzuki, Toshihisa Takagi, Ayako Tomiyasu
Keynote Speakers: Minoru Kanehisa, Hans Lehrach, Svante Paabo, Eric Davidson, Takashi Gojobori, Leroy Hood, Walter Gilbert, Yusuke Nakamura

List of Publications

• On approximation algorithms for local multiple alignment. Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 1–7. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332311
• Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function. Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 8–14. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332317
• A combinatorial approach to protein docking with flexible side-chains. E. Althaus, O. Kohlbacher, H.-P. Lenhof, P. Müller.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 15–24. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332319
• Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. Alberto Apostolico, Gill Bejerano.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 25–32. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332321
• The NOESY jigsaw: automated protein secondary structure and main-chain assignment from sparse, unassigned NMR data. Chris Bailey-Kellogg, Alik Widge, John J. Kelley, Marcelo J. Berardi, John H. Bushweller, Bruce Randall Donald.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 33–44. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332323
• Sequencing a genome by walking with clone-end sequences: a mathematical analysis. Serafim Batzoglou, Bonnie Berger, Jill Mesirov, Eric S. Lander.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 45. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332325
• Human and mouse gene structure: comparative analysis and application to exon prediction. Serafim Batzoglou, Lior Pachter, Jill Mesirov, Bonnie Berger, Eric S. Lander.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 46–53. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332326
• Tissue classification with gene expression profiles. Amir Ben-Dor, Laurakay Bruhn, Nir Friedman, Iftach Nachman, Michèel Schummer, Zohar Yakhini.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 54–64. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332328
• Universal DNA tag systems: a combinatorial design scheme. Amir Ben-Dor, Richard Karp, Benno Schwikowski, Zohar Yakhini.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 65–75. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332346
• Comprehensive statistical method for protein fold recognition. Jadwiga R. Bieńkowska, Lihua Yu, Sophia Zarakhovich, Robert G. Rogers, Temple F. Smith.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 76–85. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332347
• An analytic approach to significance assessment in local sequence alignment with gaps. R. Bundschuh.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 86–95. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332350
• Notung: dating gene duplications using gene family trees. Kevin Chen, Dannie Durand, Martin Farach-Colton.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 96–106. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332351
• A compression algorithm for DNA sequences and its applications in genome comparison. Xin Chen, Sam Kwong, Ming Li.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 107. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332352
• Multiple maxima of likelihood in phylogenetic trees: an analytic approach. Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 108–117. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332353
• Tree fitting: an algebraic approach using profile distances. Richard Desper, Martin Vingron.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 119–126. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332354
• Using Bayesian networks to analyze expression data. Nir Friedman, Michal Linial, Iftach Nachman, Dana Pe’er.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 127–135. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332355
• New algorithms for the duplication-loss model. M. T. Hallett, J. Lagergren.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 138–146. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332359
• Systematic and automated discovery of patterns in PROSITE families. Reece Hart, Ajay K. Royyuru, Gustavo Stolovitzky, Andrea Califano.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 147–154. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332360
• Contig selection in physical mapping. Steffan Heber, Jens Stoye, Jörg Hoheisel, Martin Vingron.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 155–164. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332361
• Optimizing for success: a new score function for distantly related protein sequence comparison. Maricel Kann, Richard A. Goldstein.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 177–182. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332536
• Reconstructing distances in physical maps of chromosomes with nonoverlapping probes. John Krececioglu, Sanjay Shete, Jonathan Arnold.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 183–192. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332540
• UNRES: a united-residue force field for energy-based prediction of protein structure—orgin and significance of multibody terms. Adam Liwo, Jaroslaw Pillardy, Cezary Czaplewski, Jooyoung Lee, Daniel R. Ripoll, Malgorzata Groth, Sylwia Rodziewicz-Motowidlo, Rajmund Kamierkiewicz, Ryszard J. Wawak, Stanislaw Oldziej, Harold A. Scheraga.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 193–200. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332544
• Pseudoknots in RNA secondary structures. Rune B. Lyngsø, Christian N. S. Pedersen.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 201–209. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332551
• Extracting structured motifs using a suffix tree—algorithms and application to promoter consensus identification. Laurent Marsan, Marie-France Sagot.
  • Proceedings: Research in Computational Molecular Biology. RECOMB 2000, pp 210–219. Association for Computing Machinery, New York, NY, USA.
    • DOI: 10.1145/332306.332553