ENGLISH

Combinatorial Pattern Matching: 11th Annual Symposium, CPM 2000 Montreal, Canada, June 21–23, 2000 Proceedings

By Andrei Z. Broder (auth.) , Raffaele Giancarlo , David Sankoff (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2000
ISBN
978-3-540-67633-1, 978-3-540-45123-5, 3-540-67633-3
DOI
10.1007/3-540-45123-4
Language
english
Format
PDF
Filesize
7 MB (6862764 bytes)
Series
Lecture Notes in Computer Science 1848
Edition
1
Pages
426\434
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Pattern

Description

This book constitutes the refereed proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000, held in Montreal, Canada, in June 2000. The 29 revised full papers presented together with 3 invited contributions and 2 tutorial lectures were carefully reviewed and selected from 44 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expression graphs, point sets and arrays as well as to advanced applications of CPM in areas such as Internet, computational biology, multimedia systems, information retrieval, data compression, and pattern recognition.

Similar books