Abstract is missing.
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in PopulationsDan Gusfield. 1-2 [doi]
- Lower Bounds for Succinct Data StructuresJ. Ian Munro. 3 [doi]
- The Changing Face of Web SearchPrabhakar Raghavan. 4 [doi]
- Two-Dimensional Pattern Matching with Combined Scaling and RotationChristian Hundt, Maciej Liskiewicz. 5-17 [doi]
- Searching for Gapped PalindromesRoman Kolpakov, Gregory Kucherov. 18-30 [doi]
- Parameterized Algorithms and Hardness Results for Some Graph Motif ProblemsNadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier. 31-43 [doi]
- Finding Largest Well-Predicted Subset of Protein Structure ModelsShuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li. 44-55 [doi]
- HP Distance Via Double Cut and Join DistanceAnne Bergeron, Julia Mixtacki, Jens Stoye. 56-68 [doi]
- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary PseudoknotsMathias Möhl, Sebastian Will, Rolf Backofen. 69-81 [doi]
- Faster Algorithm for the Set Variant of the String Barcoding ProblemLeszek Gasieniec, Cindy Y. Li, Meng Zhang. 82-94 [doi]
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching StatisticsTobias Marschall, Sven Rahmann. 95-106 [doi]
- Analysis of the Size of Antidictionary inJulien Fayolle. 107-117 [doi]
- Approximate String Matching with Address Bit ErrorsAmihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat. 118-129 [doi]
- On-Line Approximate String Matching with Bounded ErrorsMarcos A. Kiwi, Gonzalo Navarro, Claudio Telha. 130-142 [doi]
- A Black Box for Online Approximate Pattern MatchingRaphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat. 143-151 [doi]
- An(other) Entropy-Bounded Compressed Suffix TreeJohannes Fischer, Veli Mäkinen, Gonzalo Navarro. 152-165 [doi]
- On Compact Representations of All-Pairs-Shortest-Path-Distance MatricesIgor Nitto, Rossano Venturini. 166-177 [doi]
- Computing Inverse ST in Linear ComplexityGe Nong, Sen Zhang, Wai Hong Chan. 178-190 [doi]
- Dynamic Fully-Compressed Suffix TreesLuís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira. 191-203 [doi]
- A Linear Delay Algorithm for Building Concept LatticesMartin Farach-Colton, Yang Huang. 204-216 [doi]
- Matching Integer Intervals by Minimal Sets of Binary Words with don t caresWojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani. 217-229 [doi]
- Fast Algorithms for Computing Tree LCSShay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson. 230-243 [doi]
- Why Greed Works for Shortest Common Superstring ProblemBin Ma. 244-254 [doi]
- Constrained LCS: Hardness and ApproximationZvi Gotthilf, Danny Hermelin, Moshe Lewenstein. 255-262 [doi]
- Finding Additive Biclusters with Random BackgroundJing Xiao, Lusheng Wang, Xiaowen Liu, Tao Jiang. 263-276 [doi]
- An Improved Succinct Representation for Dynamic k-ary TreesDiego Arroyuelo. 277-289 [doi]
- Towards a Solution to the Runs ConjectureMaxime Crochemore, Lucian Ilie, Liviu Tinta. 290-302 [doi]
- On the Longest Common Parameterized SubsequenceOrgad Keller, Tsvi Kopelowitz, Moshe Lewenstein. 303-315 [doi]