Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Pattern Matching

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Raffaele Giancarlo

    1. Department of Mathematics, Università degli Studi di Palermo, Palermo, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giovanni Manzini

    1. Department of Computer Science, University of ’Piemonte Orientale’, Alessandria, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CPM 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (39 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Algorithms on Grammar-Compressed Strings

      • Gad M. Landau
      Pages 1-1

    2. Automatic Discovery of Patterns in Media Content

      • Nello Cristianini
      Pages 2-13

    3. Computational Regulatory Genomics

      • Martin Vingron
      Pages 14-14

  3. Contributed Papers

    1. Lempel-Ziv Factorization Revisited

      • Enno Ohlebusch, Simon Gog
      Pages 15-26

    2. Succincter Text Indexing with Wildcards

      • Chris Thachuk
      Pages 27-40

    3. Self-indexing Based on LZ77

      • Sebastian Kreft, Gonzalo Navarro
      Pages 41-54

    4. Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies

      • Haitao Jiang, Farong Zhong, Binhai Zhu
      Pages 55-64

    5. String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time

      • David E. Daykin, Jacqueline W. Daykin, W. F. Smyth
      Pages 65-76

    6. A d-Step Approach for Distinct Squares in Strings

      • Antoine Deza, Frantisek Franek, Mei Jiang
      Pages 77-89

    7. Tractability Results for the Consecutive-Ones Property with Multiplicity

      • Cedric Chauve, Ján Maňuch, Murray Patterson, Roland Wittler
      Pages 90-103

    8. Forest Alignment with Affine Gaps and Anchors

      • Stefanie Schirmer, Robert Giegerich
      Pages 104-117

    9. Phylogenetic Footprinting and Consistent Sets of Local Aligments

      • Wolfgang Otto, Peter F. Stadler, Sonja J. Prohaska
      Pages 118-131

    10. Unique Perfect Phylogeny Is NP-Hard

      • Michel Habib, Juraj Stacho
      Pages 132-146

    11. Fast Error-Tolerant Quartet Phylogeny Algorithms

      • Daniel G. Brown, Jakub Truszkowski
      Pages 147-161

    12. Real-Time Streaming String-Matching

      • Dany Breslauer, Zvi Galil
      Pages 162-172

    13. Simple Real-Time Constant-Space String Matching

      • Dany Breslauer, Roberto Grossi, Filippo Mignosi
      Pages 173-183

    14. Space Lower Bounds for Online Pattern Matching

      • Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
      Pages 184-196

    15. Counting Colours in Compressed Strings

      • Travis Gagie, Juha Kärkkäinen
      Pages 197-207

    16. On Wavelet Tree Construction

      • German Tischler
      Pages 208-218
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Keywords

About this book

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.

Editors and Affiliations

  • Department of Mathematics, Università degli Studi di Palermo, Palermo, Italy

    Raffaele Giancarlo

  • Department of Computer Science, University of ’Piemonte Orientale’, Alessandria, Italy

    Giovanni Manzini

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation