Abstract is missing.
- 2001-2010: Ten Years of Exact String Matching AlgorithmsSimone Faro, Thierry Lecroq. 1-2 [doi]
- Variations of Forward-SBNDMHannu Peltola, Jorma Tarhio. 3-14 [doi]
- On Compile Time Knuth-Morris-Pratt PrecomputationDerrick G. Kourie, Bruce W. Watson, Loek G. Cleophas. 15-29 [doi]
- Efficient Eager XPath Filtering over XML StreamsKazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda. 30-44 [doi]
- Inexact Graph Matching by "Geodesic Hashing" for the Alignment of Pseudoknoted RNA Secondary StructuresMira Abraham, Haim J. Wolfson. 45-57 [doi]
- Analyzing Edit Distance on Trees: Tree Swap Distance is IntractableMartin Berglund. 59-72 [doi]
- A Parameterized Formulation for the Maximum Number of Runs ProblemAndrew Baker, Antoine Deza, Frantisek Franek. 74-82 [doi]
- Finding Long and Multiple Repeats with Edit DistanceMaria Federico, Pierre Peterlongo, Nadia Pisanti, Marie-France Sagot. 83-97 [doi]
- An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning AlgorithmFrantisek Franek, Mei Jiang, Chia-Chun Weng. 98-105 [doi]
- Computing the Number of Cubic Runs in Standard Sturmian WordsMarcin Piatkowski, Wojciech Rytter. 106-120 [doi]
- Inferring Strings from Suffix Trees and Links on a Binary AlphabetTomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 121-130 [doi]
- Minimization of Acyclic DFAsJohannes Bubenzer. 132-146 [doi]
- Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set OperationsShuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato. 147-161 [doi]
- Observations On Compressed Pattern-Matching with Ranked Variables in Zimin WordsRadoslaw Glowinski, Wojciech Rytter. 162-172 [doi]
- Improving Deduplication Techniques by Accelerating Remainder CalculationsMichael Hirsch 0002, Shmuel Tomi Klein, Yair Toaff. 173-183 [doi]
- Computing Abelian Periods in WordsGabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston. 184-196 [doi]
- Computing Longest Common Substring/Subsequence of Non-linear TextsKouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 197-208 [doi]
- Algorithmics of Posets Generated by Words over Partially Commutative AlphabetsLukasz Mikulski, Marcin Piatkowski, Sebastian Smyczynski. 209-219 [doi]
- Binary Image Compression via Monochromatic Pattern Substitution: A Sequential Speed-UpLuigi Cinque, Sergio De Agostino, Luca Lombardi. 220-225 [doi]
- Improving Exact Search of Multiple Patterns From a Compressed Suffix ArrayKalle Karhu. 226-231 [doi]