Abstract is missing.
- Dynamic Succinct Data Structures and Compressed Random Access MemorySimon J. Puglisi. 1-1 [doi]
- Online Recognition of Dictionary with One GapAmihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom. 3-17 [doi]
- Range Queries Using Huffman Wavelet TreesGilad Baruch, Shmuel Tomi Klein, Dana Shapira. 18-29 [doi]
- Regular Expressions with Backreferences Re-examinedMartin Berglund, Brink van der Merwe. 30-41 [doi]
- Speeding Up String Matching by Weak Factor RecognitionDomenico Cantone, Simone Faro, Arianna Pavone. 42-50 [doi]
- Counting Mismatches with SIMDFernando J. Fiori, Waltteri Pakalén, Jorma Tarhio. 51-61 [doi]
- Dismantling DivSufSortJohannes Fischer 0001, Florian Kurpicz. 62-76 [doi]
- The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon ArrayFrantisek Franek, Asma Paracha, William F. Smyth. 77-84 [doi]
- Faster Batched Range Minimum QueriesSzymon Grabowski, Tomasz Marek Kowalski. 85-95 [doi]
- A Lempel-Ziv-style Compression Method for Repetitive TextsMarkus Mauer, Timo Beller, Enno Ohlebusch. 96-107 [doi]
- On Reverse Engineering the Lyndon TreeYuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 108-117 [doi]
- Trade-offs in Query and Target Indexing for the Selection of Candidates in Protein Homology SearchesStrahil Ristov, Robert Vaser, Mile Sikic. 118-125 [doi]
- Many-MADFAct: Concurrently Constructing MADFAsTobias Runge, Ina Schaefer, Loek Cleophas, Bruce W. Watson. 126-142 [doi]
- A Family of Exact Pattern Matching Algorithms with Multiple Adjacent Search WindowsIgor O. Zavadskyi. 152-166 [doi]