| Author | Title |
| Invited talk |
|
Gonzalo Navarro | Combining Text Compression and String Matching: The Miracle of Self-Indexing |
| Published Regular Contributions |
|
Lynette van Zijl and
Leendert Botha | Feature Extraction for Image Pattern Matching with Cellular Automata |
|
Maxime Crochemore and
Laura Giambruno | On-line construction of a small automaton for a finite set of words |
|
Domenico Cantone,
Simone Faro and
Emanuele Giaquinta | Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts |
|
Shunsuke Inenaga and
Hideo Bannai | Finding Characteristic Substrings from Compressed Texts |
|
Shmuel Tomi Klein and
Moti Meir | Delta Encoding in a Compressed Domain |
|
Manfred Kufleitner | On Bijective Variants of the Burrows-Wheeler Transform |
|
Shmuel Tomi Klein and
Dana Shapira | On the Usefulness of Backspace |
|
Matteo Campanelli,
Domenico Cantone,
Simone Faro and
Emanuele Giaquinta | An Efficient Algorithm for Approximate Pattern Matching with Swaps |
|
Ferdinando Cicalese,
Gabriele Fici and
Zsuzsanna Lipták | Searching for Jumbled Patterns in Strings |
|
M. Oğuzhan Külekci | Filter Based Fast Matching of Long Patterns by Using SIMD Instructions |
|
Julien Allali,
Pavlos Antoniou,
Costas S. Iliopoulos,
Pascal Ferraro and
Manal Mohamed | Validation and Decomposition of Partially Occluded Images with Holes |
|
Sergio De Agostino | Compressing Bi-Level Images by Block Matching on a Tree Architecture |
|
Loek Cleophas and
Kees Hemerik | Taxonomies of Regular Tree Algorithms |
|
Jan Janoušek | String Suffix Automata and Subtree Pushdown Automata |
|
Loek Cleophas,
Derrick G. Kourie,
Tinus Strauss and
Bruce W. Watson | On Minimizing Deterministic Tree Automata |
|
Sebastian Smyczyński | Constant-memory Iterative Generation of Special Strings Representing Binary Trees |
|
Heikki Hyyrö | An input sensitive online algorithm for LCS computation |
|
Kazunori Hirashima,
Hideo Bannai,
Wataru Matsubara,
Akira Ishino and
Ayumi Shinohara | Bit-parallel algorithms for computing all the runs in a string |
|
Frantisek Franek and
Yue Jiang | Crochemore's repetitions algorithm revisited–computing runs |
|
Peter Leupold | Reducing Repetitions |
|
Marcin Piątkowski and
Wojciech Rytter | Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words |
|
Costas S. Iliopoulos,
Mirka Miller and
Solon P. Pissis | Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies (updated Jan 2010) |
|
Md. Faizul Bari,
Mohammad Sohel Rahman and
Rifat Shahriyar | Finding all covers of an indeterminate string in O(n) time on average |
