default search action
25th CPM 2014: Moscow, Russia
- Alexander S. Kulikov
, Sergei O. Kuznetsov
Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings. Lecture Notes in Computer Science 8486, Springer 2014, ISBN 978-3-319-07565-5 - Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom:
On the Efficiency of the Hamming C-Centerstring Problems. 1-10 - Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. 11-20 - Amihood Amir, Benny Porat:
Approximate On-line Palindrome Recognition, and Applications. 21-29 - Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka
Computing Minimal and Maximal Suffixes of a Substring Revisited. 30-39 - Philip Bille
Compressed Subsequence Matching and Packed Tree Coloring. 40-49 - Laurent Bulteau
Reversal Distances for Strings with Few Blocks or Small Alphabets. 50-59 - Peter Burcsi
On Combinatorial Generation of Prefix Normal Words. 60-69 - Ayelet Butman, Noa Lewenstein, J. Ian Munro:
Permuted Scaled Matching. 70-78 - Amir Carmel, Noa Musa-Lempel, Dekel Tsur
The Worst Case Complexity of Maximum Parsimony. 79-88 - Bastien Cazaux, Thierry Lecroq
From Indexing Data Structures to de Bruijn Graphs. 89-99 - Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
Randomized and Parameterized Algorithms for the Closest String Problem. 100-109 - Stephane Durocher, Robert Fraser, Travis Gagie
Indexed Geometric Jumbled Pattern Matching. 110-119 - Guy Feigenblat, Ely Porat, Ariel Shiftan:
An Improved Query Time for Succinct Dynamic Dictionary Matching. 120-129 - Pawel Gawrychowski, Przemyslaw Uznanski
Order-Preserving Pattern Matching with k Mismatches. 130-139 - Danny Hermelin
Parameterized Complexity Analysis for the Closest String with Wildcards Problem. 140-149 - Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Palindromic Factorizations and Palindromic Covers On-line. 150-161 - Jan Baumbach
Compactness-Preserving Mapping on Trees. 162-171 - Atalay Mert Ileri, M. Oguzhan Külekci
Shortest Unique Substring Query Revisited. 172-181 - Artur Jez
A really Simple Approximation of Smallest Grammar. 182-191 - Tomasz Kociumaka, Solon P. Pissis
Efficient Algorithms for Shortest Partial Seeds in Words. 192-201 - Tomasz Kociumaka
Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. 202-211 - Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov:
Searching of Gapped Repeats and Subrepetitions in a Word. 212-221 - Gregory Kucherov
Approximate String Matching Using a Bidirectional Index. 222-231 - Juha Kärkkäinen, Dominik Kempa
String Range Matching. 232-241 - Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan:
On Hardness of Several String Indexing Problems. 242-251 - N. Jesper Larsson:
Most Recent Match Queries in On-Line Suffix Trees. 252-261 - Gonzalo Navarro, Sharma V. Thankachan:
Encodings for Range Majority Queries. 262-272 - Mingfu Shao, Bernard M. E. Moret
On the DCJ Median Problem. 273-282
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-26 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: