Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Combinatorial Pattern Matching

14th Annual Symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003, Proceedings

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Ricardo Baeza-Yates

    1. Depto. de Ciencias de la Computación, Universidad de Chile, Santiago, Chile

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Edgar Chávez

    1. Escuela de Ciencias Físico-Matemáticas, Universidad Michoacana, Morelia Michoacán, Mexico

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Maxime Crochemore

    1. Université de Marne-la-Vallée, Marne-la-Vallée Cedex 2, France

    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 2676)

Included in the following conference series:

Conference proceedings info: CPM 2003.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Keywords

Table of contents (28 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Multiple Genome Alignment: Chaining Algorithms Revisited

    • Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
    Pages 1-16

  3. Two-Dimensional Pattern Matching with Rotations

    • Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
    Pages 17-31

  4. An Improved Algorithm for Generalized Comparison of Minisatellites

    • Behshad Behzadi, Jean-Marc Steyaert
    Pages 32-41

  5. Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions

    • Broňa Brejová, Daniel G. Brown, Tomáš Vinař
    Pages 42-54

  6. Fast Lightweight Suffix Array Construction and Checking

    • Stefan Burkhardt, Juha Kärkkäinen
    Pages 55-69

  7. Distributed and Paged Suffix Trees for Large Genetic Databases

    • Raphaël Clifford, Marek Sergot
    Pages 70-82

  8. Analysis of Tree Edit Distance Algorithms

    • Serge Dulucq, Hélène Touzet
    Pages 83-95

  9. An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees

    • Olivier Elemento, Olivier Gascuel
    Pages 96-108

  10. Average-Optimal Multiple Approximate String Matching

    • Kimmo Fredriksson, Gonzalo Navarro
    Pages 109-128

  11. Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms

    • Raffaele Giancarlo, Marinella Sciortino
    Pages 129-143

  12. Haplotype Inference by Pure Parsimony

    • Dan Gusfield
    Pages 144-155

  13. A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions

    • Tzvika Hartman
    Pages 156-169

  14. Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals

    • Haim Kaplan, Elad Verbin
    Pages 170-185

  15. Linear-Time Construction of Suffix Arrays

    • Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park
    Pages 186-199

  16. Space Efficient Linear Time Construction of Suffix Arrays

    • Pang Ko, Srinivas Aluru
    Pages 200-210

  17. Tuning String Matching for Huge Pattern Sets

    • Jari Kytöjoki, Leena Salmela, Jorma Tarhio
    Pages 211-224

  18. Sparse LCS Common Substring Alignment

    • Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
    Pages 225-236

  19. On Minimizing Pattern Splitting in Multi-track String Matching

    • Kjell Lemström, Veli Mäkinen
    Pages 237-253

  20. Alignment between Two Multiple Alignments

    • Bin Ma, Zhuozhi Wang, Kaizhong Zhang
    Pages 254-265
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Editors and Affiliations

  • Depto. de Ciencias de la Computación, Universidad de Chile, Santiago, Chile

    Ricardo Baeza-Yates

  • Escuela de Ciencias Físico-Matemáticas, Universidad Michoacana, Morelia Michoacán, Mexico

    Edgar Chávez

  • Université de Marne-la-Vallée, Marne-la-Vallée Cedex 2, France

    Maxime Crochemore

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation