Abstract is missing.
- A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic ProgrammingGene Myers. 1-13
- A Bit-Parallel Approach to Suffix Automata: Fast Extended String MatchingGonzalo Navarro, Mathieu Raffinot. 14-33
- A Dictionary Matching Algorithm Fast on the Average for Terms of Varying LengthMichal Ziv-Ukelson, Aaron Kershenbaum. 34-54
- A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract)Christian Charras, Thierry Lecroq, Joseph Daniel Pehoushek. 55-64
- Approximate Word Sequence Matching over Sparse Suffix TreesKnut Magne Risvik. 65-79
- Efficient Parallel Algorithm for the Editing Distance between Ordered TreesKaizhong Zhang. 80-90
- Reporting Exact and Approximate Regular Expression MatchesEugene W. Myers, Paulo Oliva, Katia S. Guimarães. 91-103
- An Approximate Oracle for Distance in Metric SpacesYanling Yang, Kaizhong Zhang, Xiong Wang, Jason Tsong-Li Wang, Dennis Shasha. 104-117
- A Rotation Invariant Filter for Two-Dimensional String MatchingKimmo Fredriksson, Esko Ukkonen. 118-125
- Constructing Suffix Arrays for Multi-dimensional MatricesDong Kyue Kim, Yoo Ah Kim, Kunsoo Park. 126-139
- Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)Jens Stoye, Dan Gusfield. 140-152
- Comparison of Coding DNAChristian N. S. Pedersen, Rune B. Lyngsø, Jotun Hein. 153-173
- Fixed Topology Alignment with RecombinationBin Ma, Lusheng Wang, Ming Li. 174-188
- Aligning AlignmentsJohn D. Kececioglu, Weiqing Zhang. 189-208
- Efficient Special Cases of Pattern Matching with SwapsAmihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein. 209-220
- Aligning DNA Sequences to Minimize the Change in Protein (Extended Abstract)Yufang Hua, Tao Jiang, Bin Wu. 221-234
- Genome HalvingNadia El-Mabrouk, Joseph H. Nadeau, David Sankoff. 235-250