Full Description
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 withissues of searching and matching of strings
and other more complicated patterns such as trees, regular
expressions, extended expressions, etc. in order to derive
combinatorial properties for such structures. As an
interdisciplinary field of growing interest, CPM is related
to research in information retrieval, pattern recognition,
compilers, data compression, and program analysis as well as
to results, problems and methods from combinatorial
mathematics and molecular biology.
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.
