Skip to main content
Springer Nature Link
Log in

Combinatorial Pattern Matching

25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Alexander S. Kulikov

    1. St. Petersburg Department of Steklov Institute of Mathematics, St. Petersburg, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sergei O. Kuznetsov

    1. National Research University Higher School of Economics, Moscow, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Pavel Pevzner

    1. University of California at San Diego, La Jolla, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: CPM 2014.

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the refereed proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, held in Moscow, Russia, in June 2014. The 28 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 54 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 combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.

Similar content being viewed by others

Keywords

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  2. On the Efficiency of the Hamming C-Centerstring Problems

    • Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom
    Pages 1-10

  3. Dictionary Matching with One Gap

    • Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
    Pages 11-20

  4. Approximate On-line Palindrome Recognition, and Applications

    • Amihood Amir, Benny Porat
    Pages 21-29

  5. Computing Minimal and Maximal Suffixes of a Substring Revisited

    • Maxim Babenko, Paweł Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
    Pages 30-39

  6. Compressed Subsequence Matching and Packed Tree Coloring

    • Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
    Pages 40-49

  7. Reversal Distances for Strings with Few Blocks or Small Alphabets

    • Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
    Pages 50-59

  8. On Combinatorial Generation of Prefix Normal Words

    • Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
    Pages 60-69

  9. Permuted Scaled Matching

    • Ayelet Butman, Noa Lewenstein, J. Ian Munro
    Pages 70-78

  10. The Worst Case Complexity of Maximum Parsimony

    • Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson
    Pages 79-88

  11. From Indexing Data Structures to de Bruijn Graphs

    • Bastien Cazaux, Thierry Lecroq, Eric Rivals
    Pages 89-99

  12. Randomized and Parameterized Algorithms for the Closest String Problem

    • Zhi-Zhong Chen, Bin Ma, Lusheng Wang
    Pages 100-109

  13. Indexed Geometric Jumbled Pattern Matching

    • Stephane Durocher, Robert Fraser, Travis Gagie, Debajyoti Mondal, Matthew Skala, Sharma V. Thankachan
    Pages 110-119

  14. An Improved Query Time for Succinct Dynamic Dictionary Matching

    • Guy Feigenblat, Ely Porat, Ariel Shiftan
    Pages 120-129

  15. Order-Preserving Pattern Matching with k Mismatches

    • Paweł Gawrychowski, Przemysław Uznański
    Pages 130-139

  16. Parameterized Complexity Analysis for the Closest String with Wildcards Problem

    • Danny Hermelin, Liat Rozenberg
    Pages 140-149

  17. Computing Palindromic Factorizations and Palindromic Covers On-line

    • Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Pages 150-161

  18. Compactness-Preserving Mapping on Trees

    • Jan Baumbach, Jiong Guo, Rashid Ibragimov
    Pages 162-171

  19. Shortest Unique Substring Query Revisited

    • Atalay Mert İleri, M. Oğuzhan Külekci, Bojian Xu
    Pages 172-181

  20. A really Simple Approximation of Smallest Grammar

    • Artur Jeż
    Pages 182-191
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Editors and Affiliations

  • St. Petersburg Department of Steklov Institute of Mathematics, St. Petersburg, Russia

    Alexander S. Kulikov

  • National Research University Higher School of Economics, Moscow, Russia

    Sergei O. Kuznetsov

  • University of California at San Diego, La Jolla, USA

    Pavel Pevzner

Bibliographic Information

Publish with us

Policies and ethics

Back to top