| Author | Title |
| Invited talk |
|
Simone Faro and
Thierry Lecroq | 2001–2010: Ten Years of Exact String Matching Algorithms |
| Published Regular Contributions |
|
Hannu Peltola and
Jorma Tarhio | Variations of Forward-SBNDM |
|
Justin Kourie,
Bruce W. Watson and
Loek Cleophas | On Compile Time Knuth-Morris-Pratt Precomputation |
|
Kazuhito Hagio,
Takashi Ohgami,
Hideo Bannai and
Masayuki Takeda | Efficient Eager XPath Filtering over XML Streams |
|
Mira Abraham and
Haim J. Wolfson | Inexact Graph Matching by “Geodesic Hashing” for the Alignment of Pseudoknoted RNA Secondary Structures |
|
Martin Berglund | Analyzing Edit Distance on Trees: Tree Swap Distance is Intractable |
|
Andrew Baker,
Antonie Deza and
Frantisek Franek | A Parameterized Formulation for the Maximum Number of Runs Problem |
|
Maria Federico,
Pierre Peterlongo,
Nadia Pisanti and
Marie-France Sagot | Finding Long and Multiple Repeats with Edit Distance |
|
Frantisek Franek,
Mei Jiang and
Chia-Chun Weng | An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning Algorithm |
|
Marcin Piątkowski and
Wojciech Rytter | Computing the Number of Cubic Runs in Standard Sturmian Words |
|
Tomohiro I,
Shunsuke Inenaga,
Hideo Bannai and
Masayuki Takeda | Inferring Strings from Suffix Trees and Links on a Binary Alphabet |
|
Johannes Bubenzer | Minimization of Acyclic DFAs |
|
Shuhei Denzumi,
Ryo Yoshinaka,
Hiroki Arimura and
Shin-ichi Minato | Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations |
|
Radosław Głowinski and
Wojciech Rytter | Observations On Compressed Pattern-Matching with Ranked Variables in Zimin Words |
|
Michael Hirsch,
Shmuel Tomi Klein and
Yair Toaff | Improving Deduplication Techniques by Accelerating Remainder Calculations |
|
Gabriele Fici,
Thierry Lecroq,
Arnaud Lefebvre and
Elise Prieur-Gaston | Computing Abelian Periods in Words |
|
Kouji Shimohira,
Shunsuke Inenaga,
Hideo Bannai and
Masayuki Takeda | Computing Longest Common Substring/Subsequence of Non-linear Texts |
|
Łukasz Mikulski,
Marcin Piątkowski and
Sebastian Smyczyński | Algorithmics of Posets Generated by Words over Partially Commutative Alphabets |
|
Luigi Cinque,
Sergio De Agostino and
Luca Lombardi | Binary Image Compression via Monochromatic Pattern Substitution: A Sequential Speed-Up |
|
Kalle Karhu | Improving Exact Search of Multiple Patterns From a Compressed Suffix Array |
