Abstract is missing.
- Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit DistanceEliska Sestáková, Ondrej Guth, Jan Janousek. 1-15 [doi]
- Pitfalls of Algorithm ComparisonWaltteri Pakalén, Hannu Peltola, Jorma Tarhio, Bruce W. Watson. 16-29 [doi]
- Refined Upper Bounds on the Size of the Condensed Neighbourhood of SequencesCédric Chauve, Marni Mishna, France Paquet-Nadeau. 30-40 [doi]
- Computational Substantiation of the d-step Conjecture for Distinct Squares RevisitedFrantisek Franek, Michael Liut. 41-52 [doi]
- Counting Lyndon SubsequencesRyo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda. 53-60 [doi]
- The n-ary Initial Literal and Literal ShuffleStefan Hoffmann 0001. 61-74 [doi]
- Towards an Efficient Text Sampling Approach for Exact and Approximate MatchingSimone Faro, Francesco Pio Marino, Arianna Pavone, Antonio Scardace. 75-89 [doi]
- Searching with Extended Guard and Pivot LoopWaltteri Pakalén, Jorma Tarhio, Bruce W. Watson. 90-102 [doi]