Abstract is missing.
- The Use and Usefulness of Fibonacci CodesShmuel Tomi Klein. 1-5 [doi]
- Fast Full Permuted Pattern Matching Algorithms on Multi-track StringsDiptarama, Ryo Yoshinaka, Ayumi Shinohara. 7-21 [doi]
- Using Human Computation in Dead-zone based 2D Pattern MatchingKamil Awid, Loek Cleophas, Bruce W. Watson. 22-32 [doi]
- Generating All Minimal Petri Net Unsolvable Binary WordsEvgeny Erofeev, Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski. 33-46 [doi]
- Interpreting the Subset Construction Using Finite SublanguagesMwawi F. Msiska, Lynette van Zijl. 48-62 [doi]
- Accelerated Partial Decoding in Wavelet TreesGilad Baruch, Shmuel Tomi Klein, Dana Shapira. 63-69 [doi]
- A Family of Data Compression Codes with Multiple DelimitersIgor O. Zavadskyi, Anatoly V. Anisimov. 71-83 [doi]
- A Resource-frugal Probabilistic Dictionary and Applications in (Meta)GenomicsCamille Marchet, Antoine Limasset, Lucie Bittner, Pierre Peterlongo. 85-97 [doi]
- The String Matching Algorithms Research ToolSimone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro, Alessandro Maggio. 99-111 [doi]
- Jumbled Matching with SIMDSukhpal Singh Ghuman, Jorma Tarhio. 114-124 [doi]
- Forced Repetitions over Alphabet ListsNeerja Mhaskar, Michael Soltys. 125-134 [doi]
- n) TimeHiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 135-145 [doi]
- Computing All Approximate Enhanced Covers with the Hamming DistanceOndrej Guth. 146-157 [doi]
- Dynamic Index and LZ Factorization in Compressed SpaceTakaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 158-170 [doi]
- Algorithms to Compute the Lyndon ArrayFrantisek Franek, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, William F. Smyth. 172-184 [doi]