| Author | Title |
| Invited talk |
|
Shmuel Tomi Klein | The Use and Usefulness of Fibonacci Codes |
| Published Regular Contributions |
|
Diptarama,
Ryo Yoshinaka and
Ayumi Shinohara | Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings |
|
Kamil Awid,
Loek Cleophas and
Bruce W. Watson | Using Human Computation in Dead-zone based 2D Pattern Matching |
|
Evgeny Erofeev,
Kamila Barylska,
Łukasz Mikulski and
Marcin Piątkowski | Generating All Minimal Petri Net Unsolvable Binary Words |
|
Mwawi Msiska and
Lynette van Zijl | Interpreting the Subset Construction Using Finite Sublanguages |
|
Gilad Baruch,
Shmuel Tomi Klein and
Dana Shapira | Accelerated Partial Decoding in Wavelet Trees |
|
Igor O. Zavadskyi and
Anatoly V. Anisimov | A Family of Data Compression Codes with Multiple Delimiters |
|
Camille Marchet,
Antoine Limasset,
Lucie Bittner and
Pierre Peterlongo | A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics |
|
Simone Faro,
Thierry Lecroq,
Stefano Borzi,
Simone Di Mauro and
Alessandro Maggio | The String Matching Algorithms Research Tool |
|
Sukhpal Singh Ghuman and
Jorma Tarhio | Jumbled Matching with SIMD |
|
Mhaskar Neerja and
Michael Soltys | Forced Repetitions over Alphabet Lists |
|
Hiroe Inoue,
Yoshiaki Matsuoka,
Yuto Nakashima,
Shunsuke Inenaga,
Hideo Bannai and
Masayuki Takeda | Computing Smallest and Largest Repetition Factorizations in O(n log n) Time |
|
Ondřej Guth | Computing All Approximate Enhanced Covers with the Hamming Distance |
|
Takaaki Nishimoto,
Tomohiro I,
Shunsuke Inenaga,
Hideo Bannai and
Masayuki Takeda | Dynamic Index and LZ Factorization in Compressed Space |
|
Frantisek Franek,
A. S. M. Sohidul Islam,
Mohammad Sohel Rahman and
William F. Smyth | Algorithms to Compute the Lyndon Array |
