| 2008 | A Black Box for Online Approximate Pattern Matching. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat |
| 2008 | A Linear Delay Algorithm for Building Concept Lattices. Martin Farach-Colton, Yang Huang |
| 2008 | An Improved Succinct Representation for Dynamic k-ary Trees. Diego Arroyuelo |
| 2008 | An(other) Entropy-Bounded Compressed Suffix Tree. Johannes Fischer, Veli Mäkinen, Gonzalo Navarro |
| 2008 | Analysis of the Size of Antidictionary in. Julien Fayolle |
| 2008 | Approximate String Matching with Address Bit Errors. Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat |
| 2008 | Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings Paolo Ferragina, Gad M. Landau |
| 2008 | Computing Inverse ST in Linear Complexity. Ge Nong, Sen Zhang, Wai Hong Chan |
| 2008 | Constrained LCS: Hardness and Approximation. Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein |
| 2008 | Dynamic Fully-Compressed Suffix Trees. Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira |
| 2008 | Fast Algorithms for Computing Tree LCS. Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson |
| 2008 | Faster Algorithm for the Set Variant of the String Barcoding Problem. Leszek Gasieniec, Cindy Y. Li, Meng Zhang |
| 2008 | Finding Additive Biclusters with Random Background. Jing Xiao, Lusheng Wang, Xiaowen Liu, Tao Jiang |
| 2008 | Finding Largest Well-Predicted Subset of Protein Structure Models. Shuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li |
| 2008 | Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots. Mathias Möhl, Sebastian Will, Rolf Backofen |
| 2008 | HP Distance Via Double Cut and Join Distance. Anne Bergeron, Julia Mixtacki, Jens Stoye |
| 2008 | Lower Bounds for Succinct Data Structures. J. Ian Munro |
| 2008 | Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. Wojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani |
| 2008 | On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices. Igor Nitto, Rossano Venturini |
| 2008 | On the Longest Common Parameterized Subsequence. Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein |
| 2008 | On-Line Approximate String Matching with Bounded Errors. Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha |
| 2008 | Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier |
| 2008 | Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics. Tobias Marschall, Sven Rahmann |
| 2008 | ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations. Dan Gusfield |
| 2008 | Searching for Gapped Palindromes. Roman Kolpakov, Gregory Kucherov |
| 2008 | The Changing Face of Web Search. Prabhakar Raghavan |
| 2008 | Towards a Solution to the "Runs" Conjecture. Maxime Crochemore, Lucian Ilie, Liviu Tinta |
| 2008 | Two-Dimensional Pattern Matching with Combined Scaling and Rotation. Christian Hundt, Maciej Liskiewicz |
| 2008 | Why Greed Works for Shortest Common Superstring Problem. Bin Ma |