Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar2. RECOMB 1998: New York, NY, USA
BibTeX
RIS
RDF N-Triples
XML
Twitter
Reddit
Mendeley
BibSonomy
LinkedIn
Google+
FacebookSorin Istrail, Pavel A. Pevzner, Michael S. Waterman:
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, RECOMB 1998, New York, NY, USA, March 22-25, 1998. ACM 1998, ISBN 0-89791-976-9
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, RECOMB 1998, New York, NY, USA, March 22-25, 1998. ACM 1998, ISBN 0-89791-976-9
Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg:
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution. 9-19
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution. 9-19
Bonnie Berger, Frank Thomson Leighton:
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete. 30-39
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete. 30-39
Maria Luisa Bonet, Mike A. Steel, Tandy J. Warnow, Shibu Yooseph:
Better methods for solving parsimony and compatibility. 40-49
Better methods for solving parsimony and compatibility. 40-49
Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altman:
The hierarchical organization of molecular structure computations. 51-59
The hierarchical organization of molecular structure computations. 51-59
Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis:
On the complexity of protein folding (abstract). 61-62
On the complexity of protein folding (abstract). 61-62
Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Nitin Sharma:
Constructing maps using the span and inclusion relations. 64-73
Constructing maps using the span and inclusion relations. 64-73
Alexei V. Finkelstein, Azat Ya. Badretdinov:
How fast a protein chain can fold to its most stable structure? 74-78
How fast a protein chain can fold to its most stable structure? 74-78
Richard M. Fye, Craig J. Benham:
A formally exact method to numerically analyze local denaturation in superhelical DNA. 79-84
A formally exact method to numerically analyze local denaturation in superhelical DNA. 79-84
Israel Gelfand, Alexander Kister, Casimir A. Kulikowski, Ognyan Stoyanov:
Algorithmic determination of core positions in the VL and VH domains of immunoglobulin molecules. 85-93
Algorithmic determination of core positions in the VL and VH domains of immunoglobulin molecules. 85-93
Eugene V. Koonin, Roman L. Tatusov, Michael Y. Galperin, Michael N. Rosanov:
Genome analysis using clusters of orthologous groups (COGs). 135-139
Genome analysis using clusters of orthologous groups (COGs). 135-139
Jeffrey M. Koshi, David P. Mindell, Richard A. Goldstein:
Beyond mutation matrices: physical-chemistry based evolutionary models. 140-145
Beyond mutation matrices: physical-chemistry based evolutionary models. 140-145
Jae Kyu Lee, Vlado Dancík, Michael S. Waterman:
Estimation for restriction sites observed by optical mapping using reversible-jump Markov chain Monte Carlo. 147-152
Estimation for restriction sites observed by optical mapping using reversible-jump Markov chain Monte Carlo. 147-152
Hans-Peter Lenhof, Knut Reinert, Martin Vingron:
A polyhedral approach to RNA sequence structure alignment. 153-162
A polyhedral approach to RNA sequence structure alignment. 153-162
Rongxiang Liu, Thomas W. Blackwell, David J. States:
A structure based similarity measure for nucleic acid sequence comparison. 173-181
A structure based similarity measure for nucleic acid sequence comparison. 173-181
Bin Ma, Ming Li, Louxin Zhang:
On reconstructing species trees from gene trees in term of duplications and losses. 182-191
On reconstructing species trees from gene trees in term of duplications and losses. 182-191
Laxmi Parida, Bud Mishra:
Partitioning K clones: hardness results and practical algorithms for the K-populations problem. 192-201
Partitioning K clones: hardness results and practical algorithms for the K-populations problem. 192-201
David G. Politte, David R. Maffitt, David J. States:
Estimation of allele frequencies from color-multiplexed electropherograms. 202-206
Estimation of allele frequencies from color-multiplexed electropherograms. 202-206
Boris A. Reva, Alexei V. Finkelstein, Jeffrey Skolnick:
A self-consistent field optimization approach to build energetically and geometrically correct lattice models of proteins. 214-220
A self-consistent field optimization approach to build energetically and geometrically correct lattice models of proteins. 214-220
Isidore Rigoutsos, Aris Floratos:
Motif discovery without alignment or enumeration (extended abstract). 221-227
Motif discovery without alignment or enumeration (extended abstract). 221-227
David C. Schwartz, Thomas S. Anantharaman, C. Aston, Bud Mishra, V. Clarke, D. Gebauer, S. Delobette, E. Dimalanta, J. Edington, J. Evenzehav, J. Giacalone, C. Hiort, E. Huff, J. Jing, Z. Lai, E. Lee, J. Lin, B. Porter, R. Qi, Y. Skiadis:
New approaches to genomic analysis using single molecules. 248-250
New approaches to genomic analysis using single molecules. 248-250
Shamil R. Sunyaev, Igor V. Rodchenkov, Frank Eisenhaber, Eugene N. Kuznetsov:
Analysis of the position dependent amino acid probabilities and its application to the search for remote homologues. 258-265
Analysis of the position dependent amino acid probabilities and its application to the search for remote homologues. 258-265
Wynn L. Walker, David S. Goodsell, Elliot M. Landaw:
The theoretical limits of DNA sequence discrimination of polyamides. 270-275
The theoretical limits of DNA sequence discrimination of polyamides. 270-275
Thomas D. Wu, Trevor Hastie, Scott C. Schmidler, Douglas L. Brutlag:
Regression analysis of multiple protein structures. 276-284
Regression analysis of multiple protein structures. 276-284
Ying Xu, Dong Xu, Edward C. Uberbacher:
A new method for modeling and solving the protein fold recognition problem (extended abstract). 285-292
A new method for modeling and solving the protein fold recognition problem (extended abstract). 285-292
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-08-16 21:50 CEST by the dblp team