| 2010 | Optimizing Restriction Site Placement for Synthetic Genomes. | Pablo Montes, Heraldo Memelli, Charles B. Ward, Joondong Kim, Joseph S. B. Mitchell, Steven Skiena |
| 2010 | Finding Optimal Alignment and Consensus of Circular Strings. | Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim |
| 2010 | The Property Suffix Tree with Dynamic Properties. | Tsvi Kopelowitz |
| 2010 | Implicit Hitting Set Problems and Multi-genome Alignment. | Richard M. Karp |
| 2010 | Breakpoint Distance and PQ-Trees. | Haitao Jiang, Cdric Chauve, Binhai Zhu |
| 2010 | On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs. | Minghui Jiang |
| 2010 | Verifying a Parameterized Border Array in | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2010 | Affine Image Matching Is Uniform TC | Christian Hundt |
| 2010 | Compression, Indexing, and Retrieval for Massive String Data. | Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter |
| 2010 | Old and New in Stringology. | Zvi Galil |
| 2010 | Extended Islands of Tractability for Parsimony Haplotyping. | Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu |
| 2010 | Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. | Michael Elberfeld, Till Tantau |
| 2010 | Cover Array String Reconstruction. | Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler |
| 2010 | Algorithms for Three Versions of the Shortest Common Superstring Problem. | Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | Pseudo-realtime Pattern Matching: Closing the Gap. | Raphal Clifford, Benjamin Sach |
| 2010 | A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. | Domenico Cantone, Simone Faro, Emanuele Giaquinta |
| 2010 | Succinct Representations of Separable Graphs. | Guy E. Blelloch, Arash Farzan |
| 2010 | Succinct Dictionary Matching with No Slowdown. | Djamal Belazzougui |
| 2010 | Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. | Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente |
| 2010 | Building the Minimal Automaton of | Omar AitMous, Frdrique Bassino, Cyril Nicaud |
| 2009 | Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract). | Wei-Bung Wang, Tao Jiang |
| 2009 | Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. | Thu-Hien To, Michel Habib |
| 2009 | Periodic String Comparison. | Alexander Tiskin |
| 2009 | Linear Time Suffix Array Construction Using D-Critical Substrings. | Ge Nong, Sen Zhang, Wai Hong Chan |
| 2009 | LCS Approximation via Embedding into Local Non-repetitive Strings. | Gad M. Landau, Avivit Levy, Ilan Newman |