Abstract is missing.
- Identifying and Filtering Near-Duplicate DocumentsAndrei Z. Broder. 1-10 [doi]
- Machine Learning for Efficient Natural-Language ProcessingFernando C. N. Pereira. 11 [doi]
- Browsing around a Digital Library: Today and TomorrowIan H. Witten. 12-26 [doi]
- Algorithmic Aspects of Speech Recognition: A SynopsisAdam L. Buchsbaum, Raffaele Giancarlo. 27-32 [doi]
- Some Results on Flexible-Pattern DiscoveryLaxmi Parida. 33-45 [doi]
- Explaining and Controlling Ambiguity in Dynamic ProgrammingRobert Giegerich. 46-59 [doi]
- A Dynamic Edit Distance TableSung-Ryul Kim, Kunsoo Park. 60-68 [doi]
- Parametric Multiple Sequence Alignment and Phylogeny ConstructionDavid Fernández-Baca, Timo Seppäläinen, Giora Slutzki. 69-83 [doi]
- Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence AlignmentPaul Horton. 84-98 [doi]
- A Polynominal Time Approximation Scheme for the Closest Substring ProblemBin Ma. 99-107 [doi]
- Approximation Algorithms for Hamming Clustering ProblemsLeszek Gasieniec, Jesper Jansson, Andrzej Lingas. 108-118 [doi]
- Approximating the Maximum Isomorphic Agreement Subtree Is HardPaola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri. 119-128 [doi]
- A Faster and Unifying Algorithm for Comparing TreesMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. 129-142 [doi]
- Incomplete Directed Perfect PhylogenyItsik Pe er, Ron Shamir, Roded Sharan. 143-153 [doi]
- The Longest Common Subsequence Problem for Arc-Annotated SequencesTao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang. 154-165 [doi]
- Boyer-Moore String Matching over Ziv-Lempel Compressed TextGonzalo Navarro, Jorma Tarhio. 166-180 [doi]
- A Boyer-Moore Type Algorithm for Compressed Pattern MatchingYusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa. 181-194 [doi]
- Approximate String Matching over Ziv-Lempel Compressed TextJuha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen. 195-209 [doi]
- Improving Static Compression Schemes by Alphabet ExtensionShmuel T. Klein. 210-221 [doi]
- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous SegmentsNadia El-Mabrouk. 222-234 [doi]
- A Lower Bound for the Breakpoint Phylogeny ProblemDavid Bryant. 235-247 [doi]
- Structural Properties and Tractability Results for Linear SyntenyDavid Liben-Nowell, Jon M. Kleinberg. 248-263 [doi]
- Shift Error Detection in Standardized ExamsSteven Skiena, Pavel Sumazin. 264-276 [doi]
- An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC)Rolf Backofen. 277-292 [doi]
- The Combinatorial Partitioning MethodMatthew R. Nelson, Sharon L. Kardia, Charles F. Sing. 293-304 [doi]
- Compact Suffix ArrayVeli Mäkinen. 305-319 [doi]
- Linear Bidirectional On-Line Construction of Affix TreesMoritz G. Maaß. 320-334 [doi]
- Using Suffix Trees for Gapped Motif DiscoveryEmily Rocke. 335-349 [doi]
- Indexing Text with Approximate q-GramsGonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jorma Tarhio. 350-363 [doi]
- Simple Optimal String Matching AlgorithmCyril Allauzen, Mathieu Raffinot. 364-374 [doi]
- Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random TextsSven Rahmann, Eric Rivals. 375-387 [doi]
- Periods and Quasiperiods CharacterizationMireille Régnier, Laurent Mouchard. 388-396 [doi]
- Finding Maximal Quasiperiodicities in StringsGerth Stølting Brodal, Christian N. S. Pedersen. 397-411 [doi]
- On the Complexity of Determining the Period of a StringArtur Czumaj, Leszek Gasieniec. 412-422 [doi]