| Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings 2002 Edition Contributor(s): Apostolico, Alberto (Editor), Takeda, Masayuki (Editor) |
|
 |
ISBN: 3540438629 ISBN-13: 9783540438625 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: June 2002 Annotation: This book constitutes the refereed proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002, held in Fukuoka, Japan, in July 2002. The 21 revised full papers presented together with two invited contributions were carefully reviewed and selected from 37 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 are the World Wide Web, computational biology, computer vision, multimedia, information retrieval, data compression, and pattern recognition. |
| Additional Information |
| BISAC Categories: - Computers | Data Modeling & Design - Computers | Computer Science - Computers | Programming Languages - General |
| Dewey: 005.730 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 0.64" H x 6.14" W x 9.21" (0.94 lbs) 290 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3-5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivial combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e?ciently. Over the past decade a steady ?ow of high-quality research on this subject has changed a sparse set of isolated results into a full-?edged area of algorithmics. This area is continuing to grow even further due to the increasing demand for speed and e?ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, data compression, and pattern recognition. The objective of the annual CPM gathering is to provide an international forum for research in combinatorial p- tern matching and related applications. |