Abstract is missing.
- Computing Similarity between RNA StringsVineet Bafna, S. Muthukrishnan, R. Ravi. 1-16
- Of Chicken Teeth and Mouse Eyes, or Generalized Character CompatibilityCraig J. Benham, Sampath Kannan, Tandy Warnow. 17-26
- Efficient String Matching on Coded TextsDany Breslauer, Leszek Gasieniec. 27-40
- Fast Approximate Matching using Suffix TreesArchie L. Cobbs. 41-54
- Common Subsequences and Supersequences and Their expected LengthVlado Dancík. 55-63
- Constant-Space String Matching with Smaller Number of Comparisons: Sequential SamplingLeszek Gasieniec, Wojciech Plandowski, Wojciech Rytter. 78-89
- Multi-Dimensional Pattern Matching with Dimensional WildcardsRaffaele Giancarlo, Roberto Grossi. 90-101
- Minimizing Phylogenetic Number to find Good Evolutionary TreesLeslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow. 102-127
- Making the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment More Space Efficient in Practice (Extended Abstract)Sandeep K. Gupta, John D. Kececioglu, Alejandro A. Schäffer. 128-143
- An Efficient Algorithm for Developing Topological Valid MatchingsLiz Hanks, Ron Cytron, Will D. Gillett. 144-161
- On the Complexity of Comparing Evolutionary Trees (Extended Abstract)Jotun Hein, Tao Jiang, Lusheng Wang, Kaizhong Zhang. 177-190
- Suffix Cactus: A Cross between Suffix Tree and Suffix ArrayJuha Kärkkäinen. 191-204
- Pattern-Matching for Strings with Short DescriptionsMarek Karpinski, Wojciech Rytter, Ayumi Shinohara. 205-214
- Pairwise Alignment with Scoring on TuplesLukas Knecht. 215-229
- Matching a Set of Strings with Variable Length Don t CaresGregory Kucherov, Michaël Rusinowitch. 230-247
- Three-Dimensional Pattern Matching in Protein Structure AnalysisArthur M. Lesk. 248-260
- Genome Analysis: Pattern Search in Biological MacromoleculesHans-Werner Mewes, Klaus Heumann. 261-285
- Matching Patterns of An AutomatonMehryar Mohri. 286-297
- New Results and Open Problems Related to Non-Standard StringologyS. Muthukrishnan. 298-317
- String Matching in HypertextKunsoo Park, Dong Kyue Kim. 318-329
- Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary TreeR. Ravi, John D. Kececioglu. 330-339
- A New Flexible Algorithm for the Longest Common Subsequence ProblemClaus Rick. 340-351
- Smaller Representations for Finite-State Transducers and Finite-State AutomataEmmanuel Roche. 352-365
- Multiple Sequence Comparison: A Peptide Matching ApproachMarie-France Sagot, Alain Viari, Henry Soldano. 366-385
- On a Technique for Parsing a String (Abstract)Uzi Vishkin. 386
- Dictionary Loop-Up with Small ErrorsAndrew Chi-Chih Yao, F. Frances Yao. 387-394
- On the Editing Distance between Undirected Acyclic Graphs and Related ProblemsKaizhong Zhang, Jason Tsong-Li Wang, Dennis Shasha. 395-407