Abstract is missing.
- Combining Text Compression and String Matching: The Miracle of Self-IndexingGonzalo Navarro. 1-2 [doi]
- Feature Extraction for Image Pattern Matching with Cellular AutomataLynette van Zijl, Leendert Botha. 3-14 [doi]
- On-line Construction of a Small Automaton for a Finite Set of WordsMaxime Crochemore, Laura Giambruno. 15-28 [doi]
- Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded TextsDomenico Cantone, Simone Faro, Emanuele Giaquinta. 29-39 [doi]
- Finding Characteristic Substrings from Compressed TextsShunsuke Inenaga, Hideo Bannai. 40-54 [doi]
- Delta Encoding in a Compressed DomainShmuel Tomi Klein, Moti Meir. 55-64 [doi]
- On Bijective Variants of the Burrows-Wheeler TransformManfred Kufleitner. 65-79 [doi]
- On the Usefulness of BackspaceShmuel Tomi Klein, Dana Shapira. 80-89 [doi]
- An Efficient Algorithm for Approximate Pattern Matching with SwapsMatteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta. 90-104 [doi]
- Searching for Jumbled Patterns in StringsFerdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták. 105-117 [doi]
- Filter Based Fast Matching of Long Patterns by Using SIMD InstructionsM. Oguzhan Külekci. 118-128 [doi]
- Validation and Decomposition of Partially Occluded Images with HolesJulien Allali, Pavlos Antoniou, Costas S. Iliopoulos, Pascal Ferraro, Manal Mohamed. 129-136 [doi]
- Compressing Bi-Level Images by Block Matching on a Tree ArchitectureSergio De Agostino. 137-145 [doi]
- Taxonomies of Regular Tree AlgorithmsLoek G. Cleophas, Kees Hemerik. 146-159 [doi]
- String Suffix Automata and Subtree Pushdown AutomataJan Janousek. 160-172 [doi]
- On Minimizing Deterministic Tree AutomataLoek G. Cleophas, Derrick G. Kourie, Tinus Strauss, Bruce W. Watson. 173-182 [doi]
- Constant-memory Iterative Generation of Special Strings Representing Binary TreesSebastian Smyczynski. 183-191 [doi]
- An Input Sensitive Online Algorithm for LCS ComputationHeikki Hyyrö. 192-202 [doi]
- Bit-parallel Algorithms for Computing all the Runs in a StringKazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara. 203-213 [doi]
- Crochemore s Repetitions Algorithm Revisited - Computing RunsFrantisek Franek, Mei Jiang. 214-224 [doi]
- Reducing RepetitionsPeter Leupold. 225-236 [doi]
- Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian WordsMarcin Piatkowski, Wojciech Rytter. 237-248 [doi]
- Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing TechnologiesCostas S. Iliopoulos, Mirka Miller, Solon P. Pissis. 249-262 [doi]
- Finding All Covers of an Indeterminate String in O(n) Time on AverageMd. Faizul Bari, Mohammad Sohel Rahman, Rifat Shahriyar. 263-271 [doi]