Combinatorial Pattern Matching 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber.

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 expressi...

Full description

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Apostolico, Alberto (Editor), Crochemore, Maxime (Editor), Galil, Zvi (Editor), Manber, Udi (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1993.
Edition:	1st ed. 1993.
Series:	Lecture Notes in Computer Science, 684 Springer eBook Collection.
Subjects:	Pattern recognition. Algorithms. Natural language processing (Computer science). Information storage and retrieval. Coding theory. Information theory. Combinatorics. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

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.

Combinatorial Pattern Matching 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber.

Similar Items