Abstract is missing.
- Practical Software for Aligning ESTs to Human GenomeJun Ogasawara, Shinichi Morishita. 1-16 [doi]
- Efficient Text Mining with Optimized Pattern DiscoveryHiroki Arimura. 17-19 [doi]
- Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based CompressionWojciech Rytter. 20-31 [doi]
- Block Merging for Off-Line CompressionRaymond Wan, Alistair Moffat. 32-41 [doi]
- String Matching with Stopper Encoding and Code SplittingJussi Rautio, Jani Tanninen, Jorma Tarhio. 42-52 [doi]
- Pattern Matching Problems over 2-Interval SetsStéphane Vialette. 53-63 [doi]
- The Problem of Context Sensitive String MatchingVenkatesan T. Chakaravarthy, Rajasekar Krishnamurthy. 64-75 [doi]
- Two-Pattern StringsFrantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth. 76-84 [doi]
- Edit Distance with Move OperationsDana Shapira, James A. Storer. 85-98 [doi]
- Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear TimeJochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier. 99-114 [doi]
- Local Similarity Based Point-Pattern MatchingVeli Mäkinen, Esko Ukkonen. 115-132 [doi]
- Identifying Occurrences of Maximal Pairs in Multiple StringsCostas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas. 133-143 [doi]
- Space-Economical Algorithms for Finding Maximal Unique MatchesWing-Kai Hon, Kunihiko Sadakane. 144-152 [doi]
- The Minimum DAWG for All Suffixes of a String and Its ApplicationsShunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa. 153-167 [doi]
- On the Complexity of Deriving Position Specific Score Matrices from ExamplesTatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott. 168-177 [doi]
- Three Heuristics for delta-Matching: delta-BM AlgorithmsMaxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter. 178-189 [doi]
- A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene FindingBrona Brejová, Tomás Vinar. 190-202 [doi]
- Faster Bit-Parallel Approximate String MatchingHeikki Hyyrö, Gonzalo Navarro. 203-224 [doi]
- One-Gapped q-Gram Filtersfor Levenshtein DistanceStefan Burkhardt, Juha Kärkkäinen. 225-234 [doi]
- Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing RotationsKimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen. 235-248 [doi]
- Statistical Identification of Uniformly Mutated Segments within RepeatsSüleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün. 249-261 [doi]
- Simple and Practical Sequence Nearest Neighbors with Block OperationsS. Muthukrishnan, Süleyman Cenk Sahinalp. 262-278 [doi]
- Constructing NFA s by Optimal Use of Positions in Regular ExpressionsLucian Ilie, Sheng Yu. 279-288 [doi]