Jan Holub, Jan Zdárek (Eds.):
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009.
Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague 2009, ISBN 978-80-01-04403-2 
Invited Talk
- Gonzalo Navarro:
Combining Text Compression and String Matching: The Miracle of Self-Indexing.
1-2
Contributed Talks
- Lynette van Zijl, Leendert Botha:
Feature Extraction for Image Pattern Matching with Cellular Automata.
3-14
- Maxime Crochemore, Laura Giambruno:
On-line Construction of a Small Automaton for a Finite Set of Words.
15-28
- Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts.
29-39
- Shunsuke Inenaga, Hideo Bannai:
Finding Characteristic Substrings from Compressed Texts.
40-54
- Shmuel Tomi Klein, Moti Meir:
Delta Encoding in a Compressed Domain.
55-64
- Manfred Kufleitner:
On Bijective Variants of the Burrows-Wheeler Transform.
65-79
- Shmuel Tomi Klein, Dana Shapira:
On the Usefulness of Backspace.
80-89
- Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta:
An Efficient Algorithm for Approximate Pattern Matching with Swaps.
90-104
- Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Searching for Jumbled Patterns in Strings.
105-117
- M. Oguzhan Külekci:
Filter Based Fast Matching of Long Patterns by Using SIMD Instructions.
118-128
- Julien Allali, Pavlos Antoniou, Costas S. Iliopoulos, Pascal Ferraro, Manal Mohamed:
Validation and Decomposition of Partially Occluded Images with Holes.
129-136
- Sergio De Agostino:
Compressing Bi-Level Images by Block Matching on a Tree Architecture.
137-145
- Loek G. Cleophas, Kees Hemerik:
Taxonomies of Regular Tree Algorithms.
146-159
- Jan Janousek:
String Suffix Automata and Subtree Pushdown Automata.
160-172
- Loek G. Cleophas, Derrick G. Kourie, Tinus Strauss, Bruce W. Watson:
On Minimizing Deterministic Tree Automata.
173-182
- Sebastian Smyczynski:
Constant-memory Iterative Generation of Special Strings Representing Binary Trees.
183-191
- Heikki Hyyrö:
An Input Sensitive Online Algorithm for LCS Computation.
192-202
- Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Bit-parallel Algorithms for Computing all the Runs in a String.
203-213
- Frantisek Franek, Mei Jiang:
Crochemore's Repetitions Algorithm Revisited - Computing Runs.
214-224
- Peter Leupold:
Reducing Repetitions.
225-236
- Marcin Piatkowski, Wojciech Rytter:
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words.
237-248
- Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis:
Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies.
249-262
- Md. Faizul Bari, Mohammad Sohel Rahman, Rifat Shahriyar:
Finding All Covers of an Indeterminate String in O(n) Time on Average.
263-271
Last update Fri May 25 08:42:27 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
