| 2003 | Multiple Genome Alignment: Chaining Algorithms Revisited. | Mohamed Ibrahim Abouelhoda, Enno Ohlebusch |
| 2002 | Block Merging for Off-Line Compression. | Raymond Wan, Alistair Moffat |
| 2002 | Pattern Matching Problems over 2-Interval Sets. | Stphane Vialette |
| 2002 | Edit Distance with Move Operations. | Dana Shapira, James A. Storer |
| 2002 | Statistical Identification of Uniformly Mutated Segments within Repeats. | Sleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergn |
| 2002 | Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. | Wojciech Rytter |
| 2002 | String Matching with Stopper Encoding and Code Splitting. | Jussi Rautio, Jani Tanninen, Jorma Tarhio |
| 2002 | Practical Software for Aligning ESTs to Human Genome. | Jun Ogasawara, Shinichi Morishita |
| 2002 | Simple and Practical Sequence Nearest Neighbors with Block Operations. | S. Muthukrishnan, Sleyman Cenk Sahinalp |
| 2002 | Local Similarity Based Point-Pattern Matching. | Veli Mkinen, Esko Ukkonen |
| 2002 | The Minimum DAWG for All Suffixes of a String and Its Applications. | Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa |
| 2002 | Identifying Occurrences of Maximal Pairs in Multiple Strings. | Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas |
| 2002 | Constructing NFA s by Optimal Use of Positions in Regular Expressions. | Lucian Ilie, Sheng Yu |
| 2002 | Faster Bit-Parallel Approximate String Matching. | Heikki Hyyr, Gonzalo Navarro |
| 2002 | Space-Economical Algorithms for Finding Maximal Unique Matches. | Wing-Kai Hon, Kunihiko Sadakane |
| 2002 | Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. | Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen |
| 2002 | Two-Pattern Strings. | Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth |
| 2002 | Three Heuristics for delta-Matching: delta-BM Algorithms. | Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter |
| 2002 | The Problem of Context Sensitive String Matching. | Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy |
| 2002 | One-Gapped q-Gram Filtersfor Levenshtein Distance. | Stefan Burkhardt, Juha Krkkinen |
| 2002 | A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding. | Brona Brejov, Toms Vinar |
| 2002 | Efficient Text Mining with Optimized Pattern Discovery. | Hiroki Arimura |
| 2002 | Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. | Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier |
| 2002 | On the Complexity of Deriving Position Specific Score Matrices from Examples. | Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott |
| 2001 | What to Do with All this Hardware? (Invited Lecture). | Uzi Vishkin |