Combinatorial Pattern Matching

19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008 Proceedings

  • Editors
  • Paolo Ferragina
  • Gad M. Landau
Conference proceedings CPM 2008

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5029)

Table of contents

  1. Front Matter
    PDF

  2. Invited Talks

    1. ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
      Dan Gusfield
      Pages 1-2
    2. Lower Bounds for Succinct Data Structures
      J. Ian Munro
      Pages 3-3
    3. The Changing Face of Web Search
      Prabhakar Raghavan
      Pages 4-4

  3. Contributed Papers

    1. Two-Dimensional Pattern Matching with Combined Scaling and Rotation
      Christian Hundt, Maciej Liśkiewicz
      Pages 5-17
    2. Searching for Gapped Palindromes
      Roman Kolpakov, Gregory Kucherov
      Pages 18-30
    3. Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
      Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
      Pages 31-43
    4. Finding Largest Well-Predicted Subset of Protein Structure Models
      Shuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li
      Pages 44-55
    5. HP Distance Via Double Cut and Join Distance
      Anne Bergeron, Julia Mixtacki, Jens Stoye
      Pages 56-68
    6. Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
      Mathias Möhl, Sebastian Will, Rolf Backofen
      Pages 69-81
    7. Faster Algorithm for the Set Variant of the String Barcoding Problem
      Leszek Gąsieniec, Cindy Y. Li, Meng Zhang
      Pages 82-94
    8. Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
      Tobias Marschall, Sven Rahmann
      Pages 95-106
    9. Analysis of the Size of Antidictionary in DCA
      Julien Fayolle
      Pages 107-117
    10. Approximate String Matching with Address Bit Errors
      Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
      Pages 118-129
    11. On-Line Approximate String Matching with Bounded Errors
      Marcos Kiwi, Gonzalo Navarro, Claudio Telha
      Pages 130-142
    12. A Black Box for Online Approximate Pattern Matching
      Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat
      Pages 143-151
    13. An(other) Entropy-Bounded Compressed Suffix Tree
      Johannes Fischer, Veli Mäkinen, Gonzalo Navarro
      Pages 152-165
    14. On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
      Igor Nitto, Rossano Venturini
      Pages 166-177
    15. Computing Inverse ST in Linear Complexity
      Ge Nong, Sen Zhang, Wai Hong Chan
      Pages 178-190
    16. Dynamic Fully-Compressed Suffix Trees
      Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
      Pages 191-203

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, held in Pisa, Italy, in June 2008.

The 25 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 78 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as 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.

Keywords

Pattern Matching algorithm algorithms biology data compression data mining databases pattern recognition

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-69068-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-69066-5
  • Online ISBN 978-3-540-69068-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site