Combinatorial Pattern Matching

13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3–5, 2002 Proceedings

  • Alberto Apostolico
  • Masayuki Takeda
Conference proceedings CPM 2002
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2373)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Jun Ogasawara, Shinichi Morishita
    Pages 1-16
  3. Raymond Wan, Alistair Moffat
    Pages 32-41
  4. Jussi Rautio, Jani Tanninen, Jorma Tarhio
    Pages 42-52
  5. Stéphane Vialette
    Pages 53-63
  6. Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy
    Pages 64-75
  7. František Franěk, Jiandong Jiang, Weilin Lu, William F. Smyth
    Pages 76-84
  8. Dana Shapira, James A. Storer
    Pages 85-98
  9. Veli Mäkinen, Esko Ukkonen
    Pages 115-132
  10. Costas S. Iliopoulos, Christos Makris, Spiros Sioutas, Athanasios Tsakalidis, Kostas Tsichlas
    Pages 133-143
  11. Wing-Kai Hon, Kunihiko Sadakane
    Pages 144-152
  12. Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
    Pages 153-167
  13. Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
    Pages 168-177
  14. Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Pages 178-189
  15. Heikki Hyyrö, Gonzalo Navarro
    Pages 203-224
  16. Stefan Burkhardt, Juha Kärkkäinen
    Pages 225-234

About these proceedings

Introduction

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.

Keywords

Graph Matching computer data compression information multimedia pattern recognition regular expressions

Editors and affiliations

  • Alberto Apostolico
    • 1
  • Masayuki Takeda
    • 2
  1. 1.Department of Electrial Engineering and Computer ScienceUniversity of PadovaPadovaItaly
  2. 2.Department of InformaticsKyushu UniversityJapan

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45452-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-43862-5
  • Online ISBN 978-3-540-45452-6
  • Series Print ISSN 0302-9743
  • About this book

Industry Sectors