Combinatorial Pattern Matching

Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings
1994
ISBN: 978-3-540-58094-2
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 807, 331 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1070 g

Reihe: Lecture Notes in Computer Science

This volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatorial Pattern Matching addresses issues of searching and matching of strings and more complicated patterns, as for example trees. The goal is to derive non-trivial 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, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years.

Zielgruppe

Research

Autoren/Hrsg.

Gusfield, Dan

Crochemore, Maxime

Fachgebiete

• Mathematik | Informatik Mathematik Operations Research Graphentheorie
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Mustererkennung, Biometrik
• Mathematik | Informatik EDV | Informatik EDV & Informatik Allgemein

Inhaltsverzeichnis

A space efficient algorithm for finding the best non-overlapping alignment score.- The parameterized complexity of sequence alignment and consensus.- Computing all suboptimal alignments in linear space.- Approximation algorithms for multiple sequence alignment.- A context dependent method for comparing sequences.- Fast identification of approximately matching substrings.- Alignment of trees — An alternative to tree edit.- Parametric recomputing in alignment graphs.- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms.- A text compression scheme that allows fast searching directly in the compressed file.- An alphabet-independent optimal parallel search for three dimensional pattern.- Unit route upper bound for string-matching on hypercube.- Computation of squares in a string.- Minimization of sequential transducers.- Shortest common superstrings for strings of random letters.- Maximal common subsequences and minimal common supersequences.- Dictionary-matching on unbounded alphabets: Uniform length dictionaries.- Proximity matching using fixed-queries trees.- Query primitives for tree-structured data.- Multiple matching of parameterized patterns.- Approximate string matching with don't care characters.- Matching with matrix norm minimization.- Approximate string matching and local similarity.- Polynomial-time algorithms for computing characteristic strings.- Recent methods for RNA modeling using stochastic context-free grammars.- Efficient bounds for oriented chromosome inversion distance.