ENGLISH

Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003 Morelia, Michoacán, Mexico, June 25–27, 2003 Proceedings

By Ricardo Baeza-Yates , Mohamed Ibrahim Abouelhoda , Enno Ohlebusch (auth.) , Edgar Chávez , Maxime Crochemore (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2003
ISBN
978-3-540-40311-1, 978-3-540-44888-4, 3-540-40311-6
DOI
10.1007/3-540-44888-8
Language
english
Format
PDF
Filesize
5 MB (5177748 bytes)
Series
Lecture Notes in Computer Science 2676
Edition
1
Pages
401\412
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Coding

Description

This book constitutes the refereed proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, CPM 2003, held in Morelia, Michoac?n, Mexico in June 2003. The 28 revised full papers presented were carefully reviewed and selected from 57 submissions. The papers are devoted to current theoretical and computational aspects of searching and matching strings and more complicate patterns, such as trees, regular expressions, graphs, point sets, and arrays. Among the application fields addressed are computational biology, bioinformatics, genomics, the Web, data compression, coding, multimedia, information retrieval, pattern recognition, and computer vision.

Similar books