| 2013 | A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm. Gary Benson, Yözen Hernández, Joshua Loving |
| 2013 | A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau |
| 2013 | A Succinct Grammar Compression. Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto |
| 2013 | Approximating Shortest Superstring Problem Using de Bruijn Graphs. Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin |
| 2013 | Approximation of Grammar-Based Compression via Recompression. Artur Jez |
| 2013 | Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings Johannes Fischer, Peter Sanders |
| 2013 | Compact q-Gram Profiling of Compressed Strings. Philip Bille, Patrick Hagge Cording, Inge Li Gørtz |
| 2013 | Converting SLP to LZ78 in almost Linear Time. Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda |
| 2013 | Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. Elad Verbin, Wei Yu |
| 2013 | Discrete Methods for Image Analysis Applied to Molecular Biology. Gene Myers |
| 2013 | Document Listing on Repetitive Collections. Travis Gagie, Kalle Karhu, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén |
| 2013 | Efficient All Path Score Computations on Grid Graphs. Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson |
| 2013 | Efficient Lyndon Factorization of Grammar Compressed Text. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | External Memory Generalized Suffix and LCP Arrays Construction. Felipe A. Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri |
| 2013 | Fast Algorithm for Partial Covers in Words. Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | Forty Years of Text Indexing. Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan |
| 2013 | LCP Magic. Moshe Lewenstein |
| 2013 | Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi |
| 2013 | Local Search for String Problems: Brute Force Is Essentially Optimal. Jiong Guo, Danny Hermelin, Christian Komusiewicz |
| 2013 | Locating All Maximal Approximate Runs in a String. Mika Amit, Maxime Crochemore, Gad M. Landau |
| 2013 | New Algorithms for Position Heaps. Travis Gagie, Wing-Kai Hon, Tsung-Han Ku |
| 2013 | On Minimal and Maximal Suffixes of a Substring. Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana Starikovskaya |
| 2013 | Pattern Matching with Variables: A Multivariate Complexity Analysis. Henning Fernau, Markus L. Schmid |
| 2013 | Space-Efficient Construction Algorithm for the Circular Suffix Tree. Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan |
| 2013 | Time-Space Trade-Offs for the Longest Common Substring Problem. Tatiana Starikovskaya, Hjalte Wedel Vildhøj |