default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. RECOMB 1998: New York, NY, USA
- Sorin 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 - Ruben Abagyan:
Challenges of biomolecular structure prediction (abstract). 1 - Pankaj Agarwal, Vineet Bafna
:
Detecting non-adjoining correlations with signals in DNA. 2-8 - 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 - Gary Benson:
An algorithm for finding tandem repeats of unspecified pattern size. 20-29 - Bonnie Berger, Frank Thomson Leighton:
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 - Charles R. Cantor:
Enhancements in sequence analysis with DNA arrays (abstract). 50 - Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altman:
The hierarchical organization of molecular structure computations. 51-59 - David R. Cox:
The human genetic variation (abstract): oligonucleotide chips and human disease. 60 - Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis:
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 - Alexei V. Finkelstein, Azat Ya. Badretdinov:
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 - Israel M. Gelfand, Alexander Kister, Casimir A. Kulikowski, Ognyan Stoyanov:
Algorithmic determination of core positions in the VL and VH domains of immunoglobulin molecules. 85-93 - William Noble Grundy:
Family-based homology detection via pairwise sequence comparison. 94-100 - Klaus Gubernator:
Evolutionary drug discovery (abstract). 101 - Ian Holmes, Richard Durbin:
Dynamic programming alignment accuracy. 102-108 - Terence Hwa, Michael Lässig:
Optimal detection of sequence similarity by local alignment. 109-116 - Richard M. Karp, Ron Shamir:
Algorithms for optical mapping. 117-124 - Paul E. Kearney:
The ordinal quartet method. 125-134 - Eugene V. Koonin, Roman L. Tatusov, Michael Y. Galperin, Michael N. Rosanov:
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 - 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 - Hans-Peter Lenhof, Knut Reinert, Martin Vingron:
A polyhedral approach to RNA sequence structure alignment. 153-162 - Arthur M. Lesk:
Assessment of ab initio protein structure prediction. 163-171 - M. Levitt:
Bridging the gap between sequence and structure (abstract). 172 - Rongxiang Liu, Thomas W. Blackwell, David J. States:
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 - Laxmi Parida, Bud Mishra:
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 - Mireille Régnier:
A unified approach to word statistics. 207-213 - 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 - Isidore Rigoutsos, Aris Floratos:
Motif discovery without alignment or enumeration (extended abstract). 221-227 - Emily Rocke, Martin Tompa:
An algorithm for finding novel gapped motifs in DNA sequences. 228-233 - Marie-France Sagot, Eugene W. Myers:
Identifying satellites in nucleic acid sequences. 234-242 - David Sankoff, Mathieu Blanchette:
Multiple genome rearrangements. 243-247 - 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 - Fengzhu Sun:
Modeling DNA shuffling. 251-257 - 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 - Alexander Vologodskii:
Maxwell demon and topology simplification by type II topoisomerases. 266-269 - Wynn L. Walker, David S. Goodsell, Elliot M. Landaw:
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 - Ying Xu, Dong Xu, Edward C. Uberbacher:
A new method for modeling and solving the protein fold recognition problem (extended abstract). 285-292 - John R. Yates III:
Mass spectrometry and the proteome (abstract). 293 - Zheng Zhang, Piotr Berman, Webb Miller:
Alignments without low-scoring regions. 294-301
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-19 23:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
