Skip to main content
  • Conference proceedings
  • © 1996

Combinatorial Pattern Matching

7th Annual Symposium, CPM '96, Laguna Beach, California, June 10-12, 1996. Proceedings

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

Conference series link(s): CPM: Annual Symposium on Combinatorial Pattern Matching

Conference proceedings info: CPM 1996.

Buy it now

Buying options

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

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

Table of contents (28 papers)

  1. Front Matter

  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. Suffix trees on words

    • Arne Andersson, N. Jesper Larsson, Kurt Swanson
    Pages 102-115
  10. Perfect hashing for strings: Formalization and algorithms

    • Martin Farach, S. Muthukrishnan
    Pages 130-140
  11. Spliced alignment: A new approach to gene recognition

    • Mikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner
    Pages 141-158
  12. Original Synteny

    • Vincent Ferretti, Joseph H. Nadeau, David Sankoff
    Pages 159-167
  13. Fast sorting by reversal

    • Piotr Berman, Sridhar Hannenhalli
    Pages 168-185
  14. Improved approximation algorithms for tree alignment

    • Lusheng Wang, Dan Gusfield
    Pages 220-233
  15. Constructing computer virus phylogenies

    • Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
    Pages 253-270

Other Volumes

  1. Combinatorial Pattern Matching

About this book

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.

Bibliographic Information

Buy it now

Buying options

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