Abstract is missing.
- On the Number of Distinct SquaresFrantisek Franek. 1-2 [doi]
- Fast Regular Expression Matching Based On Dual Glushkov NFARyutaro Kurai, Norihito Yasuda, Hiroki Arimura, Shinobu Nagayama, Shin-ichi Minato. 3-16 [doi]
- A Process-Oriented Implementation of Brzozowski's DFA Construction AlgorithmTinus Strauss, Derrick G. Kourie, Bruce W. Watson, Loek G. Cleophas. 17-29 [doi]
- Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-AutomataDomenico Cantone, Simone Faro. 30-42 [doi]
- Computing Abelian Covers and Abelian RunsShohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 43-51 [doi]
- Two Squares Canonical FactorizationHaoyue Bai, Frantisek Franek, William F. Smyth. 52-58 [doi]
- Multiple Pattern Matching RevisitedRobert Susik, Szymon Grabowski, Kimmo Fredriksson. 59-70 [doi]
- Improved Two-Way Bit-parallel SearchBranislav Durian, Tamanna Chhabra, Sukhpal Singh Ghuman, Tommi Hirvola, Hannu Peltola, Jorma Tarhio. 71-83 [doi]
- Using Correctness-by-Construction to Derive Dead-zone AlgorithmsBruce W. Watson, Loek G. Cleophas, Derrick G. Kourie. 84-95 [doi]
- Random Access to Fibonacci CodesShmuel Tomi Klein, Dana Shapira. 96-109 [doi]
- Speeding up Compressed Matching with SBNDM2Kerttu Pollari-Malmi, Jussi Rautio, Jorma Tarhio. 110-123 [doi]
- Threshold Approximate Matching in Grammar-Compressed StringsAlexander Tiskin. 124-138 [doi]
- Metric Preserving Dense SIFT CompressionShmuel Tomi Klein, Dana Shapira. 139-147 [doi]
- Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of StringsBastien Cazaux, Eric Rivals. 148-161 [doi]
- Closed FactorizationGolnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto. 162-168 [doi]
- Alternative Algorithms for Lyndon FactorizationSukhpal Singh Ghuman, Emanuele Giaquinta, Jorma Tarhio. 169-178 [doi]
- Two Simple Full-Text Indexes Based on the Suffix ArraySzymon Grabowski, Marcin Raniszewski. 179-191 [doi]
- Reducing Squares in Suffix ArraysPeter Leupold. 192-201 [doi]
- New Tabulation and Sparse Dynamic Programming Based Techniques for Sequence Similarity ProblemsSzymon Grabowski. 202-211 [doi]