Abstract is missing.
- Multiple Genome Alignment: Chaining Algorithms RevisitedMohamed Ibrahim Abouelhoda, Enno Ohlebusch. 1-16 [doi]
- Two-Dimensional Pattern Matching with RotationsAmihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps. 17-31 [doi]
- An Improved Algorithm for Generalized Comparison of MinisatellitesBehshad Behzadi, Jean-Marc Steyaert. 32-41 [doi]
- Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding RegionsBrona Brejová, Daniel G. Brown, Tomás Vinar. 42-54 [doi]
- Fast Lightweight Suffix Array Construction and CheckingStefan Burkhardt, Juha Kärkkäinen. 55-69 [doi]
- Distributed and Paged Suffix Trees for Large Genetic DatabasesRaphaël Clifford, Marek J. Sergot. 70-82 [doi]
- Analysis of Tree Edit Distance AlgorithmsSerge Dulucq, Hélène Touzet. 83-95 [doi]
- An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication TreesOlivier Elemento, Olivier Gascuel. 96-108 [doi]
- Average-Optimal Multiple Approximate String MatchingKimmo Fredriksson, Gonzalo Navarro. 109-128 [doi]
- Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression AlgorithmsRaffaele Giancarlo, Marinella Sciortino. 129-143 [doi]
- Haplotype Inference by Pure ParsimonyDan Gusfield. 144-155 [doi]
- A Simpler 1.5-Approximation Algorithm for Sorting by TranspositionsTzvika Hartman. 156-169 [doi]
- Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by ReversalsHaim Kaplan, Elad Verbin. 170-185 [doi]
- Linear-Time Construction of Suffix ArraysDong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park. 186-199 [doi]
- Space Efficient Linear Time Construction of Suffix ArraysPang Ko, Srinivas Aluru. 200-210 [doi]
- Tuning String Matching for Huge Pattern SetsJari Kytöjoki, Leena Salmela, Jorma Tarhio. 211-224 [doi]
- Sparse LCS Common Substring AlignmentGad M. Landau, Baruch Schieber, Michal Ziv-Ukelson. 225-236 [doi]
- On Minimizing Pattern Splitting in Multi-track String MatchingKjell Lemström, Veli Mäkinen. 237-253 [doi]
- Alignment between Two Multiple AlignmentsBin Ma, Zhuozhi Wang, Kaizhong Zhang. 254-265 [doi]
- An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS SpectrumBin Ma, Kaizhong Zhang, Chengzhi Liang. 266-277 [doi]
- Pattern Discovery in RNA Secondary Structure Using Affix TreesGiancarlo Mauri, Giulio Pavesi. 278-294 [doi]
- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational ProgramsNadia Nedjah, Luiza de Macedo Mourelle. 295-314 [doi]
- Complexities of the Centre and Median String ProblemsFrançois Nicolas, Eric Rivals. 315-327 [doi]
- Extracting Approximate PatternsJohann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre. 328-347 [doi]
- A Fully Linear-Time Approximation Algorithm for Grammar-Based CompressionHiroshi Sakamoto. 348-360 [doi]
- Constrained Tree InclusionGabriel Valiente. 361-371 [doi]
- Working on the Problem of Sorting by Transpositions on Genome RearrangementsMaria Emilia Telles Walter, Luiz Reginaldo A. F. Curado, Adilton G. Oliveira. 372-383 [doi]
- Efficient Selection of Unique and Popular Oligos for Large EST DatabasesJie Zheng, Timothy J. Close, Tao Jiang, Stefano Lonardi. 384-401 [doi]