[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 2676 || Linear-Time Construction of Suffix Arrays

✍ Scribed by Baeza-Yates, Ricardo; Chávez, Edgar; Crochemore, Maxime

• Book ID: 121372591
• Publisher: Springer Berlin Heidelberg
• Year: 2003
• Tongue: English
• Weight: 380 KB
• Edition: 1
• Category: Article
• ISBN: 3540448888
• DOI: 10.1007/3-540-44888-8_14

✦ Synopsis

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 complicated 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.