Cover Image
Read Now

Combinatorial Pattern Matching Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings

This volume contains the 22 papers accepted for presentation at the Third Annual Symposium on Combinatorial Pattern Matching held April 29 to May 1, 1992, in Tucson, Arizona; it constitutes the first conference proceedings entirely devoted to combinatorial pattern matching (CPM). CPM deals withissue...

Full description

Bibliographic Details
Other Authors: Apostolico, Alberto (Editor), Crochemore, Maxime (Editor), Galil, Zvi (Editor), Manber, Udi (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1992, 1992
Edition:1st ed. 1992
Series:Lecture Notes in Computer Science
Subjects:
Coding And Information Theory
Coding Theory
Information Storage And Retrieval
Algorithms
Information Storage And Retrieval Systems
Information Theory
Discrete Mathematics
Natural Language Processing (nlp)
Automated Pattern Recognition
Natural Language Processing (computer Science)
Pattern Recognition Systems
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Probabilistic analysis of generalized suffix trees
  • A language approach to string searching evaluation
  • Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm
  • Fast multiple keyword searching
  • Heaviest increasing/common subsequence problems
  • Approximate regular expression pattern matching with concave gap penalties
  • Matrix longest common subsequence problem, duality and hilbert bases
  • From regular expressions to DFA's using compressed NFA's
  • Identifying periodic occurrences of a template with applications to protein structure
  • Edit distance for genome comparison based on non-local operations
  • 3-D substructure matching in protein Molecules
  • Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract)
  • Grammatical tree matching
  • Theoretical and empirical comparisons of approximate string matching algorithms
  • Fast and practical approximate string matching
  • DZ A text compression algorithm for natural languages
  • Multiple alignment with guaranteed error bounds and communication cost
  • Two algorithms for the longest common subsequence of three (or more) strings
  • Color Set Size problem with applications to string matching
  • Computing display conflicts in string and circular string visualization
  • Efficient randomized dictionary matching algorithms
  • Dynamic dictionary matching with failure functions

Similar Items