Abstract is missing.
- On the Efficiency of the Hamming C-Centerstring ProblemsAmihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom. 1-10 [doi]
- Dictionary Matching with One GapAmihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom. 11-20 [doi]
- Approximate On-line Palindrome Recognition, and ApplicationsAmihood Amir, Benny Porat. 21-29 [doi]
- Computing Minimal and Maximal Suffixes of a Substring RevisitedMaxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana A. Starikovskaya. 30-39 [doi]
- Compressed Subsequence Matching and Packed Tree ColoringPhilip Bille, Patrick Hagge Cording, Inge Li Gørtz. 40-49 [doi]
- Reversal Distances for Strings with Few Blocks or Small AlphabetsLaurent Bulteau, Guillaume Fertin, Christian Komusiewicz. 50-59 [doi]
- On Combinatorial Generation of Prefix Normal WordsPeter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada. 60-69 [doi]
- Permuted Scaled MatchingAyelet Butman, Noa Lewenstein, J. Ian Munro. 70-78 [doi]
- The Worst Case Complexity of Maximum ParsimonyAmir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson. 79-88 [doi]
- From Indexing Data Structures to de Bruijn GraphsBastien Cazaux, Thierry Lecroq, Eric Rivals. 89-99 [doi]
- Randomized and Parameterized Algorithms for the Closest String ProblemZhi-Zhong Chen, Bin Ma, Lusheng Wang. 100-109 [doi]
- Indexed Geometric Jumbled Pattern MatchingStephane Durocher, Robert Fraser, Travis Gagie, Debajyoti Mondal, Matthew Skala, Sharma V. Thankachan. 110-119 [doi]
- An Improved Query Time for Succinct Dynamic Dictionary MatchingGuy Feigenblat, Ely Porat, Ariel Shiftan. 120-129 [doi]
- Order-Preserving Pattern Matching with k MismatchesPawel Gawrychowski, Przemyslaw Uznanski. 130-139 [doi]
- Parameterized Complexity Analysis for the Closest String with Wildcards ProblemDanny Hermelin, Liat Rozenberg. 140-149 [doi]
- Computing Palindromic Factorizations and Palindromic Covers On-lineTomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 150-161 [doi]
- Compactness-Preserving Mapping on TreesJan Baumbach, Jiong Guo, Rashid Ibragimov. 162-171 [doi]
- Shortest Unique Substring Query RevisitedAtalay Mert Ileri, M. Oguzhan Külekci, Bojian Xu. 172-181 [doi]
- A really Simple Approximation of Smallest GrammarArtur Jez. 182-191 [doi]
- Efficient Algorithms for Shortest Partial Seeds in WordsTomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 192-201 [doi]
- Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn SequenceTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter. 202-211 [doi]
- Searching of Gapped Repeats and Subrepetitions in a WordRoman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov. 212-221 [doi]
- Approximate String Matching Using a Bidirectional IndexGregory Kucherov, Kamil Salikhov, Dekel Tsur. 222-231 [doi]
- String Range MatchingJuha Kärkkäinen, Dominik Kempa, Simon J. Puglisi. 232-241 [doi]
- On Hardness of Several String Indexing ProblemsKasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan. 242-251 [doi]
- Most Recent Match Queries in On-Line Suffix TreesN. Jesper Larsson. 252-261 [doi]
- Encodings for Range Majority QueriesGonzalo Navarro, Sharma V. Thankachan. 262-272 [doi]
- On the DCJ Median ProblemMingfu Shao, Bernard M. E. Moret. 273-282 [doi]