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.
Author(s): Ricardo Baeza-Yates, Gonzalo Navarro (auth.), Dan Hirschberg, Gene Myers (eds.)
Series: Lecture Notes in Computer Science 1075
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1996
Language: English
Pages: 400
Tags: Algorithm Analysis and Problem Complexity; Pattern Recognition; Document Preparation and Text Processing; Information Storage and Retrieval; Discrete Mathematics in Computer Science; Computer Appl. in Life Sciences
A faster algorithm for approximate string matching....Pages 1-23
Boyer-Moore strategy to efficient approximate string matching....Pages 24-38
Randomized efficient algorithms for compressed strings: the finger-print approach....Pages 39-49
Filtration with q -samples in approximate string matching....Pages 50-63
Computing discoveries in molecular biology....Pages 64-64
Approximate dictionary queries....Pages 65-74
Approximate multiple string search....Pages 75-86
A 2 2/3-approximation algorithm for the shortest superstring problem....Pages 87-101
Suffix trees on words....Pages 102-115
The suffix tree of a tree and minimizing sequential transducers....Pages 116-129
Perfect hashing for strings: Formalization and algorithms....Pages 130-140
Spliced alignment: A new approach to gene recognition....Pages 141-158
Original Synteny....Pages 159-167
Fast sorting by reversal....Pages 168-185
A double combinatorial approach to discovering patterns in biological sequences....Pages 186-208
Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization....Pages 209-219
Improved approximation algorithms for tree alignment....Pages 220-233
The asymmetric median tree — A new model for building consensus trees....Pages 234-252
Constructing computer virus phylogenies....Pages 253-270
Docking of conformationally flexible proteins....Pages 271-287
Invariant patterns in crystal lattices: Implications for protein folding algorithms (extended abstract)....Pages 288-303
Graph traversals, genes, and matroids: An efficient case of the travelling salesman problem....Pages 304-319
Alphabet independent and dictionary scaled matching....Pages 320-334
Analysis of two-dimensional approximate pattern matching algorithms....Pages 335-347
Approximation algorithms for maximum two-dimensional pattern matching....Pages 348-360
Efficient parallel algorithms for tree editing problems....Pages 361-372
Approximate pattern matching in directed graphs....Pages 373-383
Finite-state computability of annotations of strings and trees (extended abstract)....Pages 384-391
