CPM 2014

25th Annual Symposium on Combinatorial Pattern Matching

Moscow, Russia, June 16-18, 2014

Conference

Proceedings

Local information

Travel

Other

Accepted papers

  1. Amihood Amir and Benny Porat. Approximate On-line Palindrome Recognition, and Applications.
  2. Amihood Amir, Avivit Levy, Ely Porat and Riva Shalom. Dictionary Matching with One Gap.
  3. Amihood Amir, Jessica Ficler, Liam Roditty and Oren Sar Shalom. On the Efficiency of the Hamming C-Centerstring Problems.
  4. Amir Carmel, Noa Musa-Lempel, Dekel Tsur and Michal Ziv-Ukelson. The Worst Case Complexity of Maximum Parsimony.
  5. Artur Jez. A Really Simple Approximation of Smallest Grammar.
  6. Atalay Mert Ileri, M. Oguzhan Kulekci and Bojian Xu. Shortest Unique Substring Query Revisited.
  7. Ayelet Butman, Noa Lewenstein and Ian Munro. Permuted Scaled Matching.
  8. Bastien Cazaux, Thierry Lecroq and Eric Rivals. From Indexing Data Structures to de Bruijn Graphs.
  9. Danny Hermelin and Liat Rozenberg. Parameterized Complexity Analysis for the Closest String with Wildcards Problem.
  10. Gonzalo Navarro and Sharma V. Thankachan. Encodings for Range Majority Queries.
  11. Gregory Kucherov, Kamil Salikhov and Dekel Tsur. Approximate String Matching using a Bidirectional Index.
  12. Guy Feigenblat, Ely Porat and Ariel Shiftan. An Improved Query Time for Succinct Dynamic Dictionary Matching.
  13. Juha Kärkkäinen, Dominik Kempa and Simon Puglisi. String Range Matching.
  14. Kasper Green Larsen, Jesper Sindahl Nielsen, Sharma V. Thankachan and Ian Munro. On Hardness of Several String Indexing Problems.
  15. Laurent Bulteau, Guillaume Fertin and Christian Komusiewicz. Reversal Distances for Strings with Few Blocks or Small Alphabets.
  16. Maxim Babenko, Pawel Gawrychowski, Tomasz Kociumaka and Tatiana Starikovskaya. Computing Minimal and Maximal Suffixes of a Substring Revisited.
  17. Mingfu Shao and Bernard Moret. On the DCJ Median Problem.
  18. N. Jesper Larsson. Most Recent Match Queries in On-Line Suffix Trees.
  19. Pawel Gawrychowski and Przemyslaw Uznanski. Order-preserving Pattern Matching with k Mismatches.
  20. Péter Burcsi, Gabriele Fici, Zsuzsanna Liptak, Frank Ruskey and Joe Sawada. On Combinatorial Generation of Prefix Normal Words.
  21. Philip Bille, Patrick Hagge Cording and Inge Li Gørtz. Compressed Subsequence Matching and Packed Tree Coloring.
  22. Rashid Ibragimov, Jiong Guo and Jan Baumbach. Compactness-Preserving Mapping on Trees.
  23. Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin and Nickolay Khrapov. Searching of Gapped Repeats and Subrepetitions in a Word.
  24. Stephane Durocher, Robert Fraser, Travis Gagie, Debajyoti Mondal, Matthew Skala and Sharma Thankachan. Indexed Geometric Jumbled Pattern Matching.
  25. Tomasz Kociumaka, Jakub Radoszewski and Wojciech Rytter. Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence.
  26. Tomasz Kociumaka, Solon Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. Efficient Algorithms for Shortest Partial Seeds in Words.
  27. Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Computing Palindromic Factorizations and Palindromic Covers On-line.
  28. Zhi-Zhong Chen, Bin Ma and Lusheng Wang. Randomized and Parameterized Algorithms for the Closest String Problem.