Abstract is missing.
- Sorting by Reversals in Subquadratic TimeEric Tannier, Marie-France Sagot. 1-13 [doi]
- Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPsTamar Barzuza, Jacques S. Beckmann, Ron Shamir, Itsik Pe er. 14-31 [doi]
- Sorting by Length-Weighted Reversals: Dealing with Signs and CircularityFiras Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter. 32-46 [doi]
- Optimizing Multiple Spaced Seeds for Homology SearchJinbo Xu, Daniel G. Brown, Ming Li, Bin Ma. 47-58 [doi]
- Approximate Labelled Subtree HomeomorphismRon Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson. 59-73 [doi]
- On the Average Sequence ComplexitySvante Janson, Stefano Lonardi, Wojciech Szpankowski. 74-88 [doi]
- Approximate Point Set Pattern Matching on Sequences and PlanesTomoaki Suga, Shinichi Shimozono. 89-101 [doi]
- Finding Biclusters by Random ProjectionsStefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang. 102-116 [doi]
- Real-Time String Matching in Sublinear SpaceLeszek Gasieniec, Roman M. Kolpakov. 117-129 [doi]
- On the k-Closest Substring and k-Consensus Pattern ProblemsYishan Jiao, Jingyi Xu, Ming Li. 130-144 [doi]
- A Trie-Based Approach for Compacting AutomataMaxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi. 145-158 [doi]
- A Simple Optimal Representation for Balanced ParenthesesRichard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman. 159-172 [doi]
- Two Algorithms for LCS Consecutive Suffix AlignmentGad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson. 173-193 [doi]
- Efficient Algorithms for Finding Submasses in Weighted StringsNikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták. 194-204 [doi]
- Maximum Agreement and Compatible Supertrees (Extended Abstract)Vincent Berry, François Nicolas. 205-219 [doi]
- Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree ProblemAnders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell. 220-229 [doi]
- Small Phylogeny Problem: Character Evolution TreesArvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu. 230-243 [doi]
- The Protein Sequence Design Problem in Canonical Model on 2D and 3D LatticesPiotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang. 244-253 [doi]
- A Computational Model for RNA Multiple Structural Alignment.Eugene Davydov, Serafim Batzoglou. 254-269 [doi]
- Computational Design of New and Recombinant SelenoproteinsRolf Backofen, Anke Busch. 270-284 [doi]
- A Combinatorial Shape Matching Algorithm for Rigid Protein DockingVicky Choi, Navin Goyal. 285-296 [doi]
- Multi-seed Lossless Filtration (Extended Abstract)Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg. 297-310 [doi]
- New Results for the 2-Interval Pattern ProblemGuillaume Blin, Guillaume Fertin, Stéphane Vialette. 311-322 [doi]
- A Linear-Time Algorithm for Computing Translocation Distance between Signed GenomesGuojun Li, Xingqin Qi, Xiaoli Wang, Binhai Zhu. 323-332 [doi]
- Sparse Normalized Local AlignmentNadav Efraty, Gad M. Landau. 333-346 [doi]
- Quadratic Time Algorithms for Finding Common Intervals in Two and More SequencesThomas Schmidt, Jens Stoye. 347-358 [doi]
- Maximal Common Connected Sets of Interval GraphsMichel Habib, Christophe Paul, Mathieu Raffinot. 359-372 [doi]
- Performing Local Similarity Searches with Variable Length SeedsMiklós Csürös. 373-387 [doi]
- Reversal Distance without Hurdles and FortressesAnne Bergeron, Julia Mixtacki, Jens Stoye. 388-399 [doi]
- A Fast Set Intersection Algorithm for Sorted SequencesRicardo A. Baeza-Yates. 400-408 [doi]
- Faster Two Dimensional Pattern Matching with RotationsAmihood Amir, Oren Kapah, Dekel Tsur. 409-419 [doi]
- Compressed Compact Suffix ArraysVeli Mäkinen, Gonzalo Navarro. 420-433 [doi]
- Approximate String Matching Using Compressed Suffix ArraysTrinh N. D. Huynh, Wing-Kai Hon, Tak Wah Lam, Wing-Kin Sung. 434-444 [doi]
- Compressed Index for a Dynamic Collection of TextsHo-Leung Chan, Wing-Kai Hon, Tak Wah Lam. 445-456 [doi]
- Improved Single and Multiple Approximate String MatchingKimmo Fredriksson, Gonzalo Navarro. 457-471 [doi]
- Average-Case Analysis of Approximate Trie Search (Extended Abstract)Moritz G. Maaß. 472-484 [doi]