Abstract is missing.
- A Linear Time Pattern Matching Algorithm Between a String and a TreeTatsuya Akutsu. 1-10
- Tight Comparison Bounds for the String Prefix-Matching ProblemDany Breslauer, Livio Colussi, Laura Toniolo. 11-19
- 3-D Docking of Protein MoleculesDaniel Fischer, Raquel Norel, Ruth Nussinov, Haim J. Wolfson. 20-34
- Minimal Separators of Two WordsEmmanuelle Garel. 35-53
- Covering a StringCostas S. Iliopoulos, Dennis Moore, Kunsoo Park. 54-62
- On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k StringsRobert W. Irving, Campbell Fraser. 63-73
- An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment ScoreSampath Kannan, Eugene W. Myers. 74-86
- Exact and Approximation Algorithms for the Inversion Distance Between Two ChromosomesJohn D. Kececioglu, David Sankoff. 87-105
- The Maximum Weight Trace Problem in Multiple Sequence AlignmentJohn D. Kececioglu. 106-119
- An Algorithm for Approximate Tandem RepeatsGad M. Landau, Jeanette P. Schmidt. 120-133
- Two Dimensional Pattern Matching in a Digitized ImageGad M. Landau, Uzi Vishkin. 134-151
- Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract)Guy Louchard, Wojciech Szpankowski. 152-163
- Detecting False Matches in String Matching AlgorithmsS. Muthukrishnan. 164-178
- On Suboptimal Alignments of Biological SequencesDalit Naor, Douglas L. Brutlag. 179-196
- A Fast Filtration Algorithm for the Substring Matching ProblemPavel A. Pevzner, Michael S. Waterman. 197-214
- A Unifying Look at d-Dimensional Periodicities and Space CoveringsMireille Régnier, Ladan Rostami. 215-227
- Approximate String-Matching over Suffix TreesEsko Ukkonen. 228-242
- Multiple Sequence Comparison and n-Dimensional Image ReconstructionMartin Vingron, Pavel A. Pevzner. 243-253
- A New Editing based Distance between Unordered Labeled TreesKaizhong Zhang. 254-265