Combinatorial Pattern Matching

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

  • Alexander S. Kulikov
  • Sergei O. Kuznetsov
  • Pavel Pevzner
Conference proceedings CPM 2014

DOI: 10.1007/978-3-319-07566-2

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

Table of contents

  1. Front Matter
  2. Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom
    Pages 1-10
  3. Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
    Pages 11-20
  4. Amihood Amir, Benny Porat
    Pages 21-29
  5. Maxim Babenko, Paweł Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
    Pages 30-39
  6. Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
    Pages 40-49
  7. Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
    Pages 50-59
  8. Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
    Pages 60-69
  9. Ayelet Butman, Noa Lewenstein, J. Ian Munro
    Pages 70-78
  10. Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson
    Pages 79-88
  11. Bastien Cazaux, Thierry Lecroq, Eric Rivals
    Pages 89-99
  12. Zhi-Zhong Chen, Bin Ma, Lusheng Wang
    Pages 100-109
  13. Stephane Durocher, Robert Fraser, Travis Gagie, Debajyoti Mondal, Matthew Skala, Sharma V. Thankachan
    Pages 110-119
  14. Guy Feigenblat, Ely Porat, Ariel Shiftan
    Pages 120-129
  15. Paweł Gawrychowski, Przemysław Uznański
    Pages 130-139
  16. Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Pages 150-161
  17. Jan Baumbach, Jiong Guo, Rashid Ibragimov
    Pages 162-171
  18. Atalay Mert İleri, M. Oğuzhan Külekci, Bojian Xu
    Pages 172-181

About these proceedings

Introduction

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.

Keywords

algorithm combinatorial algorithms computational biology data compression data mining dynamic programming fixed-parameter graph algorithms analysis graphs information retrieval natural language processing network flow parallel algorithms pattern matching point sets shared memory algorithms trees

Editors and affiliations

  • Alexander S. Kulikov
    • 1
  • Sergei O. Kuznetsov
    • 2
  • Pavel Pevzner
    • 3
  1. 1.St. Petersburg Department of Steklov Institute of MathematicsSt. PetersburgRussia
  2. 2.National Research University Higher School of EconomicsMoscowRussia
  3. 3.University of California at San DiegoLa JollaUSA

Bibliographic information

  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-07565-5
  • Online ISBN 978-3-319-07566-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349