Combinatorial Pattern Matching

4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings
Herausgegeben:Apostolico, Alberto; Crochemore, Maxime; Galil, Zvi; Manber, Udi

• Broschiertes Buch

Produktbeschreibung

The papers contained in this volume were presented at theFourth Annual Symposium on Combinatorial Pattern Matching,held in Padova, Italy, in June 1993.Combinatorial pattern matching addresses issues of searchingand matching of strings and more complicated patterns suchas trees, regular expressions, extended expressions, etc.The goal is to derive nontrivial combinatorial propertiesfor such structures and then to exploit these properties inorder to achieve superior performance for the correspondingcomputational problems. In recent years, a steady flow ofhigh-quality scientific studies of this subject has changeda sparse set of isolated results into a full-fledged area ofalgorithmics.The area is expected to grow even further due to theincreasing demand for speedand efficiency that comesespecially from molecular biology and the Genome project,but also from other diverse areas such as informationretrieval, pattern recognition, compilers, data compression,and program analysis.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 684
• Verlag: Springer, Berlin
• 1993
• Seitenzahl: 280
• Erscheinungstermin: 18. Mai 1993
• Englisch
• Abmessung: 235mm x 155mm x 16mm
• Gewicht: 427g
• ISBN-13: 9783540567646
• ISBN-10: 354056764X
• Artikelnr.: 23146893

Inhaltsangabe

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.