TY  - BOOK
AU  - Apostolico,Alberto
AU  - Crochemore,Maxime
AU  - Galil,Zvi
AU  - Manber,Udi
ED  - SpringerLink (Online service)
TI  - Combinatorial Pattern Matching: 4th Annual Symposium, CPM 93 Padova, Italy, June 2–4, 1993 Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540477327
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 1993///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Coding theory
KW  - Computer software
KW  - Information storage and retrieval systems
KW  - Text processing (Computer science
KW  - Optical pattern recognition
KW  - Combinatorics
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Pattern Recognition
KW  - Document Preparation and Text Processing
KW  - Information Storage and Retrieval
KW  - Coding and Information Theory
N1  - A linear time pattern matching algorithm between a string and a tree -- Tight comparison bounds for the string prefix-matching problem -- 3-D docking of protein molecules -- Minimal separators of two words -- Covering a string -- On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings -- An algorithm for locating non-overlapping regions of maximum alignment score -- Exact and approximation algorithms for the inversion distance between two chromosomes -- The maximum weight trace problem in multiple sequence alignment -- An algorithm for approximate tandem repeats -- Two dimensional pattern matching in a digitized image -- Analysis of a string edit problem in a probabilistic framework -- Detecting false matches in string matching algorithms -- On suboptimal alignments of biological sequences -- A fast filtration algorithm for the substring matching problem -- A unifying look at d-dimensional periodicities and space coverings -- Approximate string-matching over suffix trees -- Multiple sequence comparison and n-dimensional image reconstruction -- A new editing based distance between unordered labeled trees
N2  - The papers contained in this volume were presented at the Fourth Annual Symposium on Combinatorial Pattern Matching, held in Padova, Italy, in June 1993. Combinatorial pattern matching addresses issues of searching and matching of strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The goal is to derive nontrivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, a steady flow of high-quality scientific studies of this subject has changed a sparse set of isolated results into a full-fledged area of algorithmics. The area is expected to grow even further due to the increasing demand for speedand efficiency that comes especially from molecular biology and the Genome project, but also from other diverse areas such as information retrieval, pattern recognition, compilers, data compression, and program analysis
UR  - http://dx.doi.org/10.1007/BFb0029791
ER  -