Table of contents

  1. Front Matter
    PDF
  2. A faster algorithm for approximate string matching
    Ricardo Baeza-Yates, Gonzalo Navarro
    Pages 1-23
  3. Boyer-Moore strategy to efficient approximate string matching
    Nadia El-Mabrouk, Maxime Crochemore
    Pages 24-38
  4. Randomized efficient algorithms for compressed strings: the finger-print approach
    Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
    Pages 39-49
  5. Filtration with q-samples in approximate string matching
    Erkki Sutinen, Jorma Tarhio
    Pages 50-63
  6. Computing discoveries in molecular biology
    David J. Lipman
    Pages 64-64
  7. Approximate dictionary queries
    Gerth Stølting Brodal, Leszek Gasieniec
    Pages 65-74
  8. Approximate multiple string search
    Robert Muth, Udi Manber
    Pages 75-86
  9. A 2 2/3-approximation algorithm for the shortest superstring problem
    Chris Armen, Clifford Stein
    Pages 87-101
  10. Suffix trees on words
    Arne Andersson, N. Jesper Larsson, Kurt Swanson
    Pages 102-115
  11. The suffix tree of a tree and minimizing sequential transducers
    Dany Breslauer
    Pages 116-129
  12. Perfect hashing for strings: Formalization and algorithms
    Martin Farach, S. Muthukrishnan
    Pages 130-140
  13. Spliced alignment: A new approach to gene recognition
    Mikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner
    Pages 141-158
  14. Original Synteny
    Vincent Ferretti, Joseph H. Nadeau, David Sankoff
    Pages 159-167
  15. Fast sorting by reversal
    Piotr Berman, Sridhar Hannenhalli
    Pages 168-185
  16. A double combinatorial approach to discovering patterns in biological sequences
    Marie -France Sagot, Alain Viari
    Pages 186-208
  17. Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization
    Richard Arratia, Gesine Reinert
    Pages 209-219
  18. Improved approximation algorithms for tree alignment
    Lusheng Wang, Dan Gusfield
    Pages 220-233
  19. The asymmetric median tree — A new model for building consensus trees
    Cynthia Phillips, Tandy J. Warnow
    Pages 234-252
  20. Constructing computer virus phylogenies
    Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
    Pages 253-270

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, CPM '96, held in Laguna Beach, California, USA, in June 1996.
The 26 revised full papers included were selected from a total of 48 submissions; also included are two invited papers. Combinatorial pattern matching has become a full-fledged area of algorithmics with important applications in recent years.
The book addresses all relevant aspects of combinatorial pattern matching and its importance in information retrieval, pattern recognition, compiling, data compression, program analysis, and molecular biology and thus describes the state of the art in the area.

Keywords

Matching algorithm algorithmics algorithms biology data compression pattern recognition

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-61258-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-61258-2
  • Online ISBN 978-3-540-68390-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site