| Approximate Circular Pattern Matching | 0 | 0.34 | 2022 |
| Efficient Computation of Sequence Mappability | 0 | 0.34 | 2022 |
| Faster Algorithms for Longest Common Substring. | 0 | 0.34 | 2021 |
| Computing Covers of 2D-Strings. | 0 | 0.34 | 2021 |
| The Number of Repetitions in 2D-Strings | 0 | 0.34 | 2020 |
| Efficient Enumeration of Distinct Factors Using Package Representations. | 0 | 0.34 | 2020 |
| Unary Words Have the Smallest Levenshtein k-Neighbourhoods. | 0 | 0.34 | 2020 |
| Internal Dictionary Matching. | 0 | 0.34 | 2019 |
| Weighted Shortest Common Supersequence Problem Revisited. | 0 | 0.34 | 2019 |
| Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. | 0 | 0.34 | 2019 |
| Circular Pattern Matching with k Mismatches. | 0 | 0.34 | 2019 |
| Linear-Time Algorithm for Long LCF with k Mismatches. | 3 | 0.41 | 2018 |
