Abstract is missing.
- A Faster Longest Common Extension Algorithm on Compressed Strings and its ApplicationsShunsuke Inenaga. 1-4 [doi]
- Computing Left-Right Maximal Generic WordsTakaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 5-16 [doi]
- Combinatorics of the Interrupted PeriodAdrien Thierry. 17-21 [doi]
- An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching ProblemDomenico Cantone, Simone Faro, M. Oguzhan Külekci. 22-35 [doi]
- Alternative Algorithms for Order-Preserving MatchingTamanna Chhabra, M. Oguzhan Külekci, Jorma Tarhio. 36-46 [doi]
- Efficient Algorithm for δ-Approximate Jumbled Pattern MatchingIván Castellanos, Yoan J. Pinzón. 47-56 [doi]
- Tuning Algorithms for Jumbled MatchingTamanna Chhabra, Sukhpal Singh Ghuman, Jorma Tarhio. 57-66 [doi]
- Enhanced Extraction from Huffman Encoded FilesShmuel Tomi Klein, Dana Shapira. 67-77 [doi]
- Controlling the Chunk-Size in Deduplication SystemsMichael Hirsch 0002, Shmuel Tomi Klein, Dana Shapira, Yair Toaff. 78-89 [doi]
- A Formal Framework for StringologyNeerja Mhaskar, Michael Soltys. 90-103 [doi]
- Quantum Leap Pattern MatchingBruce W. Watson, Derrick G. Kourie, Loek G. Cleophas. 104-117 [doi]
- Parameterized Matching: Solutions and ExtensionsJuan Mendivelso, Yoan J. Pinzón. 118-131 [doi]
- Refined Tagging of Complex Verbal Phrases for the Italian LanguageSimone Faro, Arianna Pavone. 132-145 [doi]