CPM 2014: Moscow, Russia
Invited Talks.
Proceedings.
- Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom:
On the Efficiency of the Hamming C-Centerstring Problems. 1-10
download presentation (PPTX)
download paper
- Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. 11-20
download presentation (PPTX)
download paper
watch video
- Amihood Amir, Benny Porat:
Approximate On-line Palindrome Recognition, and Applications. 21-29
download presentation (PPTX)
download paper
watch video
- Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana A. Starikovskaya:
Computing Minimal and Maximal Suffixes of a Substring Revisited. 30-39
download presentation (PDF)
download paper
watch video
- Philip Bille, Patrick Hagge Cording, Inge Li Gortz:
Compressed Subsequence Matching and Packed Tree Coloring. 40-49
download presentation (PDF)
download paper
watch video
- Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
Reversal Distances for Strings with Few Blocks or Small Alphabets. 50-59
download paper
watch video
- Peter Burcsi, Gabriele Fici, Zsuzsanna Liptak, Frank Ruskey, Joe Sawada:
Combinatorial Generation of Prefix Normal Words. 60-69
download presentation (PDF)
download paper
watch video
- Ayelet Butman, Noa Lewenstein, J. Ian Munro:
Permuted Scaled Matching. 70-78
download presentation (PPTX)
download paper
watch video
- Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson:
The Worst Case Complexity of Maximum Parsimony. 79-88
download presentation (PDF)
download paper
watch video
- Bastien Cazaux, Thierry Lecroq, Eric Rivals:
From Indexing Data Structures to de Bruijn Graphs. 89-99
download presentation (PDF)
download paper
watch video
- Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
Randomized and Parameterized Algorithms for the Closest String Problem. 100-109
download presentation (PDF)
download paper
- Stephane Durocher, Robert Fraser, Travis Gagie, Debajyoti Mondal, Matthew Skala, Sharma V. Thankachan:
Indexed Geometric Jumbled Pattern Matching. 110-119
download presentation (PDF)
download paper
watch video
- Guy Feigenblat, Ely Porat, Ariel Shiftan:
An Improved Query Time for Succinct Dynamic Dictionary Matching. 120-129
download presentation (PDF)
download paper
watch video
- Pawel Gawrychowski, Przemyslaw Uznanski:
Order-Preserving Pattern Matching with k Mismatches. 130-139
download presentation (PDF)
download paper
watch video
- Danny Hermelin, Liat Rozenberg:
Parameterized Complexity Analysis for the Closest String with Wildcards Problem. 140-149
download presentation (PPTX)
download paper
- Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Palindromic Factorizations and Palindromic Covers On-line. 150-161
download presentation (PPTX)
download paper
watch video
- Jan Baumbach, Jiong Guo, Rashid Ibragimov:
Compactness-Preserving Mapping on Trees. 162-171
download presentation (PDF)
download paper
watch video
- Atalay Mert Ileri, M. Oguzhan Kulekci, Bojian Xu:
Shortest Unique Substring Query Revisited. 172-181
download presentation (PDF)
download paper
watch video
- Artur Jez:
A really Simple Approximation of Smallest Grammar. 182-191
download presentation (PDF)
download paper
watch video
- Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Algorithms for Shortest Partial Seeds in Words. 192-201
download presentation (PDF)
download paper
watch video
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. 202-211
download presentation (PDF)
download paper
watch video
- Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov:
Searching of Gapped Repeats and Subrepetitions in a Word. 212-221
download presentation (PDF)
download paper
watch video
- Gregory Kucherov, Kamil Salikhov, Dekel Tsur:
Approximate String Matching Using a Bidirectional Index. 222-231
download presentation (PDF)
download paper
watch video
- Juha Karkkainen, Dominik Kempa, Simon J. Puglisi:
String Range Matching. 232-241
download presentation (PDF)
download paper
watch video
- Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan:
On Hardness of Several String Indexing Problems. 242-251
download presentation (PDF)
download paper
watch video
- N. Jesper Larsson:
Most Recent Match Queries in On-Line Suffix Trees. 252-261
download presentation (PDF)
download paper
watch video
- Gonzalo Navarro, Sharma V. Thankachan:
Encodings for Range Majority Queries. 262-272
download presentation (PDF)
download paper
watch video
- Mingfu Shao, Bernard M. E. Moret:
On the DCJ Median Problem. 273-282
download presentation (PDF)
download paper
watch video