Abstract is missing.
- Reactive Links to Save Automata StatesMaxime Crochemore, Dov M. Gabbay. 1-8 [doi]
- Improving Automata Efficiency by Stretching and JammingNoud de Beijer, Loek G. Cleophas, Derrick G. Kourie, Bruce W. Watson. 9-24 [doi]
- Simple Tree Pattern Matching for Trees in the Prefix Bar NotationJan Lahoda, Jan Zdárek. 25-36 [doi]
- Approximate String Matching Allowing for Inversions and TranslocationsDomenico Cantone, Simone Faro, Emanuele Giaquinta. 37-51 [doi]
- (In)approximability Results for Pattern Matching ProblemsRaphaël Clifford, Alexandru Popa. 52-62 [doi]
- A Space-Efficient Implementation of the Good-Suffix HeuristicDomenico Cantone, Salvatore Cristofaro, Simone Faro. 63-75 [doi]
- k Best Strings ProblemMartin Berglund, Frank Drewes. 76-88 [doi]
- Tiling Binary Matrices in Haplotyping: Complexity, Models and AlgorithmsGiuseppe Lancia, Romeo Rizzi, Russell Schwartz. 89-102 [doi]
- Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and ScalabilityLuigi Cinque, Sergio De Agostino, Luca Lombardi. 103-115 [doi]
- Practical Fixed Length Lempel Ziv CodingShmuel Tomi Klein, Dana Shapira. 116-126 [doi]
- Tight and Simple Web Graph CompressionSzymon Grabowski, Wojciech Bieniecki. 127-137 [doi]
- New Simple Efficient Algorithms Computing Powers and Runs in StringsMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen. 138-149 [doi]
- Inferring Strings from RunsWataru Matsubara, Akira Ishino, Ayumi Shinohara. 150-160 [doi]
- Bounded Number of Squares in Infinite Repetition-Constrained Binary WordsGolnaz Badkobeh, Maxime Crochemore. 161-166 [doi]
- Average Number of Runs and Squares in NecklaceKazuhiko Kusano, Ayumi Shinohara. 167-177 [doi]
- The Number of Runs in a Ternary WordHideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson. 178-181 [doi]
- Formal Characterizations of FA-based String ProcessorsErnest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie. 183-185 [doi]