Combinatorial Pattern Matching

22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings

  • Raffaele Giancarlo
  • Giovanni Manzini

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Contributed Papers

    1. Enno Ohlebusch, Simon Gog
      Pages 15-26
    2. Chris Thachuk
      Pages 27-40
    3. Sebastian Kreft, Gonzalo Navarro
      Pages 41-54
    4. Haitao Jiang, Farong Zhong, Binhai Zhu
      Pages 55-64
    5. David E. Daykin, Jacqueline W. Daykin, W. F. Smyth
      Pages 65-76
    6. Antoine Deza, Frantisek Franek, Mei Jiang
      Pages 77-89
    7. Cedric Chauve, Ján Maňuch, Murray Patterson, Roland Wittler
      Pages 90-103
    8. Stefanie Schirmer, Robert Giegerich
      Pages 104-117
    9. Wolfgang Otto, Peter F. Stadler, Sonja J. Prohaska
      Pages 118-131
    10. Michel Habib, Juraj Stacho
      Pages 132-146
    11. Daniel G. Brown, Jakub Truszkowski
      Pages 147-161
    12. Dany Breslauer, Zvi Galil
      Pages 162-172
    13. Dany Breslauer, Roberto Grossi, Filippo Mignosi
      Pages 173-183
    14. Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
      Pages 184-196
    15. Travis Gagie, Juha Kärkkäinen
      Pages 197-207
    16. German Tischler
      Pages 208-218

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011.
The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing and pattern recognition.

Keywords

approximation algorithms computational complexity graph algoithms graph computation search algorithms sequence alignment string matching

Editors and affiliations

  • Raffaele Giancarlo
    • 1
  • Giovanni Manzini
    • 2
  1. 1.Department of MathematicsUniversità degli Studi di PalermoPalermoItaly
  2. 2.Department of Computer ScienceUniversity of ’Piemonte Orientale’AlessandriaItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-21458-5
  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-21457-8
  • Online ISBN 978-3-642-21458-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book