ENGLISH

Combinatorial Pattern Matching: Third Annual Symposium Tucson, Arizona, USA, April 29–May 1, 1992 Proceedings

By Maxime Crochemore , Alberto Apostolico , Wojciech Szpankowski (auth.) , Zvi Galil , Udi Manber (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1992
ISBN
978-3-540-56024-1, 978-3-540-47357-2
DOI
10.1007/3-540-56024-6
Language
english
Format
PDF
Filesize
5 MB (5205573 bytes)
Series
Lecture Notes in Computer Science 644
Edition
1
Pages
293\296
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
Algorithm Analysis and Problem Complexity; Pattern

Description

This volume contains the 22 papers accepted for presentation at the Third Annual Symposium on Combinatorial Pattern Matching held April 29 to May 1, 1992, in Tucson, Arizona; it constitutes the first conference proceedings entirely devoted to combinatorial pattern matching (CPM). CPM deals withissues of searching and matching of strings and other more complicated patterns such as trees, regular expressions, extended expressions, etc. in order to derive combinatorial properties for such structures. As an interdisciplinary field of growing interest, CPM is related to research in information retrieval, pattern recognition, compilers, data compression, and program analysis as well as to results, problems and methods from combinatorial mathematics and molecular biology.

Similar books