ENGLISH

Combinatorial Pattern Matching: 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1–4, 2001 Proceedings

By Gad M. Landau (auth.) , Amihood Amir (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
978-3-540-42271-6, 978-3-540-48194-2, 3-540-42271-4
DOI
10.1007/3-540-48194-X
Language
english
Format
PDF
Filesize
4 MB (3849447 bytes)
Series
Lecture Notes in Computer Science 2089
Edition
1
Pages
280\281
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Pattern

Description

This book constitutes the refereed proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001, held in Jerusalem, Israel, in July 2001. The 21 revised papers presented together with one invited paper were carefully reviewed and selected from 35 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays as well as to advanced applications of CPM in areas such as the Internet, computational biology, multimedia systems, information retrieval, data compression, coding, computer vision, and pattern recognition.

Similar books