Combinatorial Pattern Matching: 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings

by Alberto Apostolico (editor)

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.

280 pages, Paperback

First published June 24, 1993