Abstract is missing.
- A Faster Algorithm for Approximate String MatchingRicardo A. Baeza-Yates, Gonzalo Navarro. 1-23
- Boyer-Moore Strategy to Efficient Approximate String MatchingNadia El-Mabrouk, Maxime Crochemore. 24-38
- Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter. 39-49
- Filtration with q-Samples in Approximate String MatchingErkki Sutinen, Jorma Tarhio. 50-63
- Computing Discoveries in Molecular Biology (Abstract)David J. Lipman. 64
- Approximate Dictionary QueriesGerth Stølting Brodal, Leszek Gasieniec. 65-74
- Approximate Multiple Strings SearchRobert Muth, Udi Manber. 75-86
- A 2 2/3-Approximation Algorithm for the Shortest Superstring ProblemChris Armen, Clifford Stein. 87-101
- Suffix Trees on WordsArne Andersson, N. Jesper Larsson, Kurt Swanson. 102-115
- The suffix Tree of a Tree and Minimizing Sequential TransducersDany Breslauer. 116-129
- Perfect Hashing for Strings: Formalization and AlgorithmsMartin Farach, S. Muthukrishnan. 130-140
- Spliced Alignment: A New Approach to Gene RecognitionMikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner. 141-158
- Original SyntenyVincent Ferretti, Joseph H. Nadeau, David Sankoff. 159-167
- Fast Sorting by ReversalPiotr Berman, Sridhar Hannenhalli. 168-185
- A Double Combinatorial Approach to Discovering Patterns in Biological SequencesMarie-France Sagot, Alain Viari. 186-208
- Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by HybridizationRichard Arratia, Gesine Reinert. 209-219
- Improved Approximation Algorithms for Tree AlignmentLusheng Wang, Dan Gusfield. 220-233
- The Asymmetric Median Tree - A New model for Building Consensus TreesCynthia A. Phillips, Tandy Warnow. 234-252
- Constructing Computer Virus PhylogeniesLeslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin. 253-270
- Docking of Conformationally Flexible ProteinsBilha Sandak, Ruth Nussinov, Haim J. Wolfson. 271-287
- Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract)William E. Hart, Sorin Istrail. 288-303
- Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman ProblemDan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling. 304-319
- Alphabet Independent and Dictionary Scaled MatchingAmihood Amir, Gruia Calinescu. 320-334
- Analysis of Two-Dimensional Approximate Pattern Matching AlgorithmsKunsoo Park. 335-347
- Approximation Algorithms for Maximum Two-Dimensional Pattern MatchingSrinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe. 348-360
- Efficient Parallel Algorithms for Tree Editing ProblemsKaizhong Zhang. 361-372
- Approximate Pattern Matching in Directed GraphsJames J. Fu. 373-383
- Finite-State Computability of Annotations of Strings and TreesHans Leo Bodlaender, Michael R. Fellows, Patricia A. Evans. 384-391