| 2011 | Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. | Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2011 | Computational Regulatory Genomics. | Martin Vingron |
| 2011 | Sparse and Truncated Suffix Trees on Variable-Length Codes. | Takashi Uemura, Hiroki Arimura |
| 2011 | On Wavelet Tree Construction. | German Tischler |
| 2011 | Succincter Text Indexing with Wildcards. | Chris Thachuk |
| 2011 | Forest Alignment with Affine Gaps and Anchors. | Stefanie Schirmer, Robert Giegerich |
| 2011 | A Combinatorial Model of Phyllotaxis Perturbations in | Yassin Refahi, Etienne Farcot, Yann Gudon, Fabrice Besnard, Teva Vernoux, Christophe Godin |
| 2011 | Edit Distance with Duplications and Contractions Revisited. | Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson |
| 2011 | Phylogenetic Footprinting and Consistent Sets of Local Aligments. | Wolfgang Otto, Peter F. Stadler, Sonja J. Prohaska |
| 2011 | Lempel-Ziv Factorization Revisited. | Enno Ohlebusch, Simon Gog |
| 2011 | A Coarse-to-Fine Approach to Computing the | Jesper Nielsen |
| 2011 | Algorithms on Grammar-Compressed Strings. | Gad M. Landau |
| 2011 | Self-indexing Based on LZ77. | Sebastian Kreft, Gonzalo Navarro |
| 2011 | Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies. | Haitao Jiang, Farong Zhong, Binhai Zhu |
| 2011 | Palindrome Pattern Matching. | Tomohiro I, Shunsuke Inenaga, Masayuki Takeda |
| 2011 | Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees. | Kouichi Hirata, Yoshiyuki Yamamoto, Tetsuji Kuboyama |
| 2011 | Unique Perfect Phylogeny Is | Michel Habib, Juraj Stacho |
| 2011 | Frequent Submap Discovery. | Stphane Gosselin, Guillaume Damiand, Christine Solnon |
| 2011 | Quick Greedy Computation for Minimum Common String Partitions. | Isaac Goldstein, Moshe Lewenstein |
| 2011 | Counting Colours in Compressed Strings. | Travis Gagie, Juha Krkkinen |
| 2011 | On the Weak Prefix-Search Problem. | Paolo Ferragina |
| 2011 | Approximation Algorithms for Orienting Mixed Graphs. | Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan |
| 2011 | Finding Approximate and Constrained Motifs in Graphs. | Riccardo Dondi, Guillaume Fertin, Stphane Vialette |
| 2011 | A | Antoine Deza, Frantisek Franek, Mei Jiang |
| 2011 | String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time. | David E. Daykin, Jacqueline W. Daykin, William F. Smyth |