default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. WABI 2001: Aarhus, Denmark
- Olivier Gascuel, Bernard M. E. Moret:
Algorithms in Bioinformatics, First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings. Lecture Notes in Computer Science 2149, Springer 2001, ISBN 3-540-42516-0 - István Miklós, Zoltán Toroczkai
:
An Improved Model for Statistical Alignment. 1-10 - Niklas von Öhsen, Ralf Zimmer:
Improving Profile-Profile Alignments via Log Average Scoring. 11-26 - Thomas S. Anantharaman, Bud Mishra:
False Positives in Genomic Map Assembly and Sequence Validation. 27-40 - Thomas Schiex, Patrick Chabrier, Martin Bouchez, Denis Milan:
Boosting EM for Radiation Hybrid and Genetic Mapping. 41-51 - Will Casey, Bud Mishra, Michael Wigler:
Placing Probes along the Genome Using Pairwise Distance Data. 52-68 - Arun K. Jagota, Rune B. Lyngsø, Christian N. S. Pedersen:
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar. 69-94 - Alain Denise, Mireille Régnier, Mathias Vandenbogaert:
Assessing the Statistical Significance of Overrepresented Oligonucleotides. 85-97 - Juris Viksna, David R. Gilbert:
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies. 98-111 - Herbert Edelsbrunner, Afra Zomorodian:
Computing Linking Numbers of a Filtration. 112-127 - Olivia Eriksson, Yishao Zhou, Arne Elofsson:
Side Chain-Positioning as an Integer Programming Problem. 128-141 - Tal Pupko, Roded Sharan, Masami Hasegawa, Ron Shamir, Dan Graur:
A Chemical-Distance-Based Test for Positive Darwinian Selection. 142-155 - Ganeshkumar Ganapathysaravanabavan, Tandy J. Warnow:
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time. 156-163 - Anne Bergeron, François Strasbourg:
Experiments in Computing Sequences of Reversals. 164-174 - Li-San Wang:
Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes. 175-188 - Adam C. Siepel, Bernard M. E. Moret:
Finding an Optimal Inversion Median: Experimental Results. 189-203 - Benny Chor, Michael D. Hendy, David Penny:
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites. 204-213 - Luay Nakhleh, Usman Roshan, Katherine St. John, Jerry Sun, Tandy J. Warnow:
The Performance of Phylogenetic Methods on Trees of Bounded Diameter. 214-226 - Niklas Eriksen:
(1+epsilon)-Approximation of Sorting by Reversals and Transpositions. 227-237 - Alberto Caprara:
On the Practical Solution of the Reversal Median Problem. 238-251 - Steffen Heber, Jens Stoye:
Algorithms for Finding Gene Clusters. 252-263 - Peter J. van der Veen, Lodewyk F. A. Wessels, J. W. Slootstra, R. H. Meloen, Marcel J. T. Reinders, Johannes Hellendoorn:
Determination of Binding Amino Acids Based on Random Peptide Array Screening Data. 264-277 - Yoseph Barash, Gill Bejerano, Nir Friedman:
A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites. 278-293 - Daniel H. Huson, Aaron L. Halpern, Zhongwu Lai, Eugene W. Myers, Knut Reinert, Granger G. Sutton:
Comparing Assemblies Using Fragments and Mate-Pairs. 294-306
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 2025-12-23 00:30 CET 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:
