CPM B

29 papers

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