default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th CPM 2013: Bad Herrenalb, Germany
- Johannes Fischer, Peter Sanders:
Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. Lecture Notes in Computer Science 7922, Springer 2013, ISBN 978-3-642-38904-7 - Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton
, Zvi Galil, S. Muthukrishnan:
Forty Years of Text Indexing. 1-10 - Moshe Lewenstein:
LCP Magic. 11 - Gene Myers:
Discrete Methods for Image Analysis Applied to Molecular Biology. 12 - Mika Amit, Maxime Crochemore, Gad M. Landau:
Locating All Maximal Approximate Runs in a String. 13-27 - Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana Starikovskaya:
On Minimal and Maximal Suffixes of a Substring. 28-37 - Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda:
Converting SLP to LZ78 in almost Linear Time. 38-49 - Gary Benson, Yözen Hernández, Joshua Loving:
A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm. 50-61 - Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact q-Gram Profiling of Compressed Strings. 62-73 - Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau:
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. 74-82 - Henning Fernau, Markus L. Schmid:
Pattern Matching with Variables: A Multivariate Complexity Analysis. 83-94 - Travis Gagie, Wing-Kai Hon, Tsung-Han Ku:
New Algorithms for Position Heaps. 95-106 - Travis Gagie, Kalle Karhu, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén:
Document Listing on Repetitive Collections. 107-119 - Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Approximating Shortest Superstring Problem Using de Bruijn Graphs. 120-129 - Jiong Guo, Danny Hermelin, Christian Komusiewicz:
Local Search for String Problems: Brute Force Is Essentially Optimal. 130-141 - Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan:
Space-Efficient Construction Algorithm for the Circular Suffix Tree. 142-152 - Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Lyndon Factorization of Grammar Compressed Text. 153-164 - Artur Jez:
Approximation of Grammar-Based Compression via Recompression. 165-176 - Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. 177-188 - Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. 189-200 - Felipe A. Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri:
External Memory Generalized Suffix and LCP Arrays Construction. 201-210 - Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson:
Efficient All Path Score Computations on Grid Graphs. 211-222 - Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for the Longest Common Substring Problem. 223-234 - Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto:
A Succinct Grammar Compression. 235-246 - Elad Verbin, Wei Yu:
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. 247-258
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-15 19:20 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:
