| 2008 | Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. | Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier |
| 2008 | HP Distance Via Double Cut and Join Distance. | Anne Bergeron, Julia Mixtacki, Jens Stoye |
| 2008 | An Improved Succinct Representation for Dynamic k-ary Trees. | Diego Arroyuelo |
| 2008 | Approximate String Matching with Address Bit Errors. | Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat |
| 2007 | Computing Exact p-Value for Structured Motif. | Jing Zhang, Xi Chen, Ming Li |
| 2007 | Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors. | Frances F. Yao |
| 2007 | Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. | Yufeng Wu, Dan Gusfield |
| 2007 | Space-Efficient Algorithms for Document Retrieval. | Niko Vlimki, Veli Mkinen |
| 2007 | Finding Compact Structural Motifs. | Jianbo Qian, Shuai Cheng Li, Dongbo Bu, Ming Li, Jinbo Xu |
| 2007 | Improved Sketching of Hamming Distance with Error Correcting. | Ely Porat, Ohad Lipsky |
| 2007 | Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge. | Zeshan Peng, Hing-Fung Ting |
| 2007 | Efficient Computation of Substring Equivalence Classes with Suffix Arrays. | Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2007 | Stringology: Some Classic and Some Modern Problems. | S. Muthukrishnan |
| 2007 | Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. | Shay Mozes, Oren Weimann, Michal Ziv-Ukelson |
| 2007 | Processing Compressed Texts: A Tractability Border. | Yury Lifshits |
| 2007 | Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts. | Sunho Lee, Kunsoo Park |
| 2007 | A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. | Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park |
| 2007 | On Demand String Sorting over Unbounded Alphabets. | Carmel Kent, Moshe Lewenstein, Dafna Sheinwald |
| 2007 | Tiling Periodicity. | Juhani Karhumki, Yury Lifshits, Wojciech Rytter |
| 2007 | Most Burrows-Wheeler Based Compressors Are Not Optimal. | Haim Kaplan, Elad Verbin |
| 2007 | A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search. | Tao Jiang |
| 2007 | Algorithms for Computing the Longest Parameterized Common Subsequence. | Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen |
| 2007 | Cache-Oblivious Index for Approximate String Matching. | Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter |
| 2007 | Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. | Sylvain Guillemot, Vincent Berry |
| 2007 | Compressed Text Indexes with Fast Locate. | Rodrigo Gonzlez, Gonzalo Navarro |