ENGLISH

Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings

By Amihood Amir , Kaizhong Zhang , Yunkun Zhu (auth.) , Laxmi Parida (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2010
ISBN
3642135080, 9783642135088
DOI
10.1007/978-3-642-13509-5
Language
english
Format
PDF
Filesize
5 MB (5616555 bytes)
Series
Lecture Notes in Computer Science 6129 : Theoretical Computer Science and General Issues
Edition
1
Pages
362\373
Topic
Computers
Time added
2011-06-04 13:46:07
Algorithm Analysis and Problem Complexity; Data St

Description

This book constitutes the refereed proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, held in New York, USA, in June 2010. The 28 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 53 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays with special focus on coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching.

Similar books