| 2007 | A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search. Tao Jiang |
| 2007 | A Lempel-Ziv Text Index on Secondary Storage. Diego Arroyuelo, Gonzalo Navarro |
| 2007 | A New and Faster Method of Sorting by Transpositions. Maxime Benoît-Gagné, Sylvie Hamel |
| 2007 | A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park |
| 2007 | Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors. Frances F. Yao |
| 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 | Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings Bin Ma, Kaizhong Zhang |
| 2007 | Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette |
| 2007 | Compressed Text Indexes with Fast Locate. Rodrigo González, Gonzalo Navarro |
| 2007 | Computing Exact p-Value for Structured Motif. Jing Zhang, Xi Chen, Ming Li |
| 2007 | Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. Amihood Amir, Oren Kapah, Ely Porat |
| 2007 | Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts. Sunho Lee, Kunsoo Park |
| 2007 | Efficient Computation of Substring Equivalence Classes with Suffix Arrays. Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2007 | Fast and Practical Algorithms for Computing All the Runs in a String. Gang Chen, Simon J. Puglisi, William F. Smyth |
| 2007 | Finding Compact Structural Motifs. Jianbo Qian, Shuai Cheng Li, Dongbo Bu, Ming Li, Jinbo Xu |
| 2007 | Finding Witnesses by Peeling. Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur |
| 2007 | Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. Sylvain Guillemot, Vincent Berry |
| 2007 | Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge. Zeshan Peng, Hing-Fung Ting |
| 2007 | Identification of Distinguishing Motifs. Wangsen Feng, Zhanyong Wang, Lusheng Wang |
| 2007 | Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. Yufeng Wu, Dan Gusfield |
| 2007 | Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. Philip Bille, Rolf Fagerberg, Inge Li Gørtz |
| 2007 | Improved Sketching of Hamming Distance with Error Correcting. Ely Porat, Ohad Lipsky |
| 2007 | Longest Common Separable Pattern Among Permutations. Mathilde Bouvel, Dominique Rossin, Stéphane Vialette |
| 2007 | Most Burrows-Wheeler Based Compressors Are Not Optimal. Haim Kaplan, Elad Verbin |
| 2007 | Move-to-Front, Distance Coding, and Inversion Frequencies Revisited. Travis Gagie, Giovanni Manzini |
| 2007 | Non-breaking Similarity of Genomes with Gene Repetitions. Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu |
| 2007 | On Demand String Sorting over Unbounded Alphabets. Carmel Kent, Moshe Lewenstein, Dafna Sheinwald |
| 2007 | Processing Compressed Texts: A Tractability Border. Yury Lifshits |
| 2007 | Self-normalised Distance with Don't Cares. Peter Clifford, Raphaël Clifford |
| 2007 | Space-Efficient Algorithms for Document Retrieval. Niko Välimäki, Veli Mäkinen |
| 2007 | Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Shay Mozes, Oren Weimann, Michal Ziv-Ukelson |
| 2007 | Stringology: Some Classic and Some Modern Problems. S. Muthukrishnan |
| 2007 | Suffix Arrays on Words. Paolo Ferragina, Johannes Fischer |
| 2007 | Tiling Periodicity. Juhani Karhumäki, Yury Lifshits, Wojciech Rytter |
| 2007 | Two-Dimensional Range Minimum Queries. Amihood Amir, Johannes Fischer, Moshe Lewenstein |