Skip to main content
SpringerLink
Log in
Book cover

Algorithms in Bioinformatics

First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Olivier Gascuel

    1. LIRMM, Montpellier, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bernard M. E. Moret

    1. Department of Computer Science, University of New Mexico, Albuquerque, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2149)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. An Improved Model for Statistical Alignment

    • István Miklós, Zoltán Toroczkai
    Pages 1-10

  3. Improving Profile-Profile Alignments via Log Average Scoring

    • Niklas von Ohsen, Ralf Zimmer
    Pages 11-26

  4. False Positives in Genomic Map Assembly and Sequence Validation

    • Thomas Anantharaman, Bud Mishra
    Pages 27-40

  5. Boosting EM for Radiation Hybrid and Genetic Mapping

    • Thomas Schiex, Patrick Chabrier, Martin Bouchez, Denis Milan
    Pages 41-51

  6. Placing Probes along the Genome Using Pairwise Distance Data

    • Will Casey, Bud Mishra, Mike Wigler
    Pages 52-68

  7. Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar

    • Arun Jagota, Rune B. Lyngsø, Christian N. S. Pedersen
    Pages 69-84

  8. Assessing the Statistical Significance of Overrepresented Oligonucleotides

    • Alain Denise, Mireille Régnier, Mathias Vandenbogaert
    Pages 85-97

  9. Pattern Matching and Pattern Discovery Algorithms for Protein Topologies

    • Juris Víksna, David Gilbert
    Pages 98-111

  10. Computing Linking Numbers of a Filtration

    • Herbert Edelsbrunner, Afra Zomorodian
    Pages 112-127

  11. Side Chain-Positioning as an Integer Programming Problem

    • Olivia Eriksson, Yishao Zhou, Arne Elofsson
    Pages 128-141

  12. A Chemical-Distance-Based Test for Positive Darwinian Selection

    • Tal Pupko, Roded Sharan, Masami Hasegawa, Ron Shamir, Dan Graur
    Pages 142-155

  13. Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time

    • Ganeshkumar Ganapathysaravanabavan, Tandy Warnow
    Pages 156-163

  14. Experiments in Computing Sequences of Reversals

    • Anne Bergeron, François Strasbourg
    Pages 164-174

  15. Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes

    • Li-San Wang
    Pages 175-188

  16. Finding an Optimal Inversion Median: Experimental Results

    • Adam C. Siepel, Bernard M. E. Moret
    Pages 189-203

  17. Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites

    • Benny Chor, Michael Hendy, David Penny
    Pages 204-213

  18. The Performance of Phylogenetic Methods on Trees of Bounded Diameter

    • Luay Nakhleh, Usman Roshan, Katherine St. John, Jerry Sun, Tandy Warnow
    Pages 214-226

  19. (1+ε)-Approximation of Sorting by Reversals and Transpositions

    • Niklas Eriksen
    Pages 227-237

  20. On the Practical Solution of the Reversal Median Problem

    • Alberto Caprara
    Pages 238-251
Back to top

Keywords

Editors and Affiliations

  • LIRMM, Montpellier, France

    Olivier Gascuel

  • Department of Computer Science, University of New Mexico, Albuquerque, USA

    Bernard M. E. Moret

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation