Skip to main content
  • Conference proceedings
  • © 2003

Algorithms in Bioinformatics

Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003, Proceedings

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

Part of the book sub series: Lecture Notes in Bioinformatics (LNBI)

Conference series link(s): WABI: International Workshop on Algorithms in Bioinformatics

Conference proceedings info: WABI 2003.

Buy it now

Buying options

Softcover Book USD 109.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

Table of contents (36 papers)

  1. Front Matter

  2. Comparative Genomics

    1. A Local Chaining Algorithm and Its Applications in Comparative Genomics

      • Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
      Pages 1-16
    2. Common Intervals of Two Sequences

      • Gilles Didier
      Pages 17-24
    3. A Systematic Statistical Analysis of Ion Trap Tandem Mass Spectra in View of Peptide Scoring

      • Jacques Colinge, Alexandre Masselot, Jérôme Magnin
      Pages 25-38
    4. Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specificity

      • Broňa Brejová, Daniel G. Brown, Tomáš VinaÅ™
      Pages 39-54
  3. Gene Finding and Expression

    1. Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency

      • Broňa Brejová, Daniel G. Brown, Tomáš VinaÅ™
      Pages 78-94
  4. Genome Mapping

    1. New Algorithm for the Simplified Partial Digest Problem

      • J. BÅ‚ażewicz, M. Jaroszewski
      Pages 95-110
    2. Noisy Data Make the Partial Digest Problem NP-hard

      • Mark Cieliebak, Stephan Eidenbenz, Paolo Penna
      Pages 111-123
  5. Phylogenetic Analysis

    1. Efficient Generation of Uniform Samples from Phylogenetic Trees

      • Paul Kearney, J. Ian Munro, Derek Phillips
      Pages 177-189
    2. Ancestral Maximum Likelihood of Evolutionary Trees Is Hard

      • Louigi Addario-Berry, Benny Chor, Mike Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
      Pages 202-215
    3. A Linear-Time Majority Tree Algorithm

      • Nina Amenta, Frederick Clarke, Katherine St. John
      Pages 216-227
    4. Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model

      • Gerton Lunter, István Miklós, Alexei Drummond, Jens Ledet Jensen, Jotun Hein
      Pages 228-244
    5. Better Hill-Climbing Searches for Parsimony

      • Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy Warnow
      Pages 245-258

Other Volumes

  1. Algorithms in Bioinformatics

Editors and Affiliations

  • Department of Biomathematical Sciences, The Mount Sinai School of Medicine, New York, NY

    Gary Benson

  • Institute of Biomedical and Life Sciences, Division of Environmental and Evolutionary Biology, University of Glasgow, Glasgow, Scotland

    Roderic D. M. Page

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 109.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