| Shortest Covers Of All Cyclic Shifts Of A String | 0 | 0.34 | 2021 |
| Circular pattern matching with k mismatches | 0 | 0.34 | 2021 |
| Internal Dictionary Matching | 0 | 0.34 | 2021 |
| Hardness of Detecting Abelian and Additive Square Factors in Strings. | 0 | 0.34 | 2021 |
| String Covers of a Tree. | 0 | 0.34 | 2021 |
| Counting Distinct Patterns in Internal Dictionary Matching | 0 | 0.34 | 2020 |
| A Linear-Time Algorithm for Seeds Computation | 1 | 0.37 | 2020 |
| The Number of Repetitions in 2D-Strings | 0 | 0.34 | 2020 |
| Efficient Enumeration of Distinct Factors Using Package Representations. | 0 | 0.34 | 2020 |
| Internal Quasiperiod Queries | 0 | 0.34 | 2020 |
| Unary Words Have the Smallest Levenshtein k-Neighbourhoods. | 0 | 0.34 | 2020 |
| Shortest Covers Of All Cyclic Shifts Of A String | 0 | 0.34 | 2020 |
| Efficient Representation and Counting of Antipower Factors in Words. | 1 | 0.40 | 2019 |
| Internal Dictionary Matching. | 0 | 0.34 | 2019 |
| Quasi-Linear-Time Algorithm for Longest Common Circular Factor. | 0 | 0.34 | 2019 |
| Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. | 0 | 0.34 | 2019 |
| String periods in the order-preserving model. | 0 | 0.34 | 2018 |
| Internal pattern matching queries in a text and applications | 9 | 0.56 | 2015 |
| Covering Problems for Partial Words and for Indeterminate Strings. | 4 | 0.43 | 2014 |
| Efficient Algorithms for Shortest Partial Seeds in Words. | 3 | 0.41 | 2014 |
| Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. | 1 | 0.35 | 2014 |
| Extracting powers and periods in a word from its runs structure | 16 | 0.67 | 2014 |
| Rna Bricks-A Database Of Rna 3d Motifs And Their Interactions | 7 | 0.50 | 2014 |
| On the String Consensus Problem and the Manhattan Sequence Consensus Problem | 1 | 0.37 | 2014 |
| Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. | 0 | 0.34 | 2013 |
| A linear time algorithm for consecutive permutation pattern matching. | 30 | 1.44 | 2013 |
| On the maximum number of cubic subwords in a word | 3 | 0.49 | 2013 |
| A note on efficient computation of all Abelian periods in a string | 7 | 0.61 | 2013 |
| Computing the Longest Previous Factor | 8 | 0.54 | 2013 |
| Fast Algorithm for Partial Covers in Words. | 1 | 0.35 | 2013 |
| Efficient seed computation revisited | 2 | 0.38 | 2013 |
| Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes | 16 | 0.97 | 2013 |
| Order-Preserving Suffix Trees and Their Algorithmic Applications | 2 | 0.42 | 2013 |
| Efficient counting of square substrings in a tree | 2 | 0.41 | 2012 |
| The maximal number of cubic runs in a word | 1 | 0.35 | 2012 |
| A linear time algorithm for seeds computation | 13 | 0.64 | 2012 |
| The maximum number of squares in a tree | 7 | 0.54 | 2012 |
| On the maximal sum of exponents of runs in a string | 6 | 0.63 | 2012 |
| Efficient data structures for the factor periodicity problem | 11 | 0.65 | 2012 |
| Efficient algorithms for three variants of the LPF table | 10 | 0.49 | 2012 |
| New simple efficient algorithms computing powers and runs in strings. | 3 | 0.40 | 2010 |
| On the maximal number of cubic runs in a string | 198 | 6.46 | 2010 |
| Extracting powers and periods in a string from its runs structure | 234 | 6.64 | 2010 |
| Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays | 8 | 0.50 | 2010 |
| Improved induced matchings in sparse graphs | 5 | 0.48 | 2010 |
| Algorithms for three versions of the shortest common superstring problem | 6 | 0.50 | 2010 |
| On the maximal number of highly periodic runs in a string | 0 | 0.34 | 2009 |
| On the Maximal Number of Cubic Subwords in a String | 8 | 1.26 | 2009 |
| LPF Computation Revisited | 17 | 0.71 | 2009 |
| Improved algorithms for the range next value problem and applications | 11 | 0.57 | 2008 |
