| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6075975 | 2023-09-20 | Paper |
| Subsequence covers of words | 2023-08-04 | Paper |
| Faster recovery of approximate periods over edit distance | 2023-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098782 | 2023-06-14 | Paper |
| Tight bound for the number of distinct palindromes in a tree | 2023-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874434 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874436 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874500 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875583 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088916 | 2022-07-18 | Paper |
| String covers of a tree | 2022-06-15 | Paper |
| Efficient representation and counting of antipower factors in words | 2022-06-13 | Paper |
| A periodicity lemma for partial words | 2022-03-14 | Paper |
| Internal dictionary matching | 2021-06-30 | Paper |
| A Linear-Time Algorithm for Seeds Computation | 2021-05-03 | Paper |
| Shortest covers of all cyclic shifts of a string | 2021-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140788 | 2020-12-16 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304137 | 2020-08-05 | Paper |
| Shortest covers of all cyclic shifts of a string | 2020-07-22 | Paper |
| Universal reconstruction of a string | 2020-02-20 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-01-30 | Paper |
| String periods in the order-preserving model | 2020-01-17 | Paper |
| Efficient representation and counting of antipower factors in words | 2019-12-04 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2019-06-06 | Paper |
| A Linear-Time Algorithm for Seeds Computation | 2019-05-10 | Paper |
| Near-optimal computation of runs over general alphabet via non-crossing LCE queries | 2018-10-17 | Paper |
| On periodicity lemma for partial words | 2018-06-26 | Paper |
| On the string consensus problem and the Manhattan sequence consensus problem | 2018-02-16 | Paper |
| Efficient algorithms for shortest partial seeds in words | 2018-02-16 | Paper |
| String powers in trees | 2017-11-09 | Paper |
| Covering problems for partial words and for indeterminate strings | 2017-11-06 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2017-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369537 | 2017-10-17 | Paper |
| Internal Pattern Matching Queries in a Text and Applications | 2017-10-05 | Paper |
| Maximum number of distinct and nonequivalent nonstandard squares in a word | 2016-09-12 | Paper |
| Order-preserving indexing | 2016-06-16 | Paper |
| Polynomial-time approximation algorithms for weighted LCS problem | 2016-04-07 | Paper |
| On the greedy algorithm for the shortest common superstring problem with reversals | 2016-01-05 | Paper |
| Universal Reconstruction of a String | 2015-10-30 | Paper |
| Linear-time version of Holub's algorithm for morphic imprimitivity testing | 2015-09-25 | Paper |
| New simple efficient algorithms computing powers and runs in strings | 2015-09-22 | Paper |
| Covering problems for partial words and for indeterminate strings | 2015-09-11 | Paper |
| Fast algorithm for partial covers in words | 2015-09-03 | Paper |
| A note on the longest common compatible prefix problem for partial words | 2015-08-24 | Paper |
| String Powers in Trees | 2015-08-20 | Paper |
| On the String Consensus Problem and the Manhattan Sequence Consensus Problem | 2015-02-10 | Paper |
| Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word | 2014-10-14 | Paper |
| A linear time algorithm for consecutive permutation pattern matching | 2014-08-13 | Paper |
| Efficient counting of square substrings in a tree | 2014-07-07 | Paper |
| Efficient Algorithms for Shortest Partial Seeds in Words | 2014-06-30 | Paper |
| Extracting powers and periods in a word from its runs structure | 2014-01-22 | Paper |
| Efficient seed computation revisited | 2014-01-09 | Paper |
| Fast Algorithm for Partial Covers in Words | 2013-06-14 | Paper |
| Efficient Counting of Square Substrings in a Tree | 2013-03-21 | Paper |
| A note on efficient computation of all abelian periods in a string | 2013-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910720 | 2013-03-19 | Paper |
| Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing | 2013-03-18 | Paper |
| Computing the longest previous factor | 2012-11-15 | Paper |
| On the maximum number of cubic subwords in a word | 2012-11-15 | Paper |
| The maximal number of cubic runs in a word | 2012-11-06 | Paper |
| On the maximal sum of exponents of runs in a string | 2012-09-13 | Paper |
| The Maximum Number of Squares in a Tree | 2012-08-14 | Paper |
| Improved algorithms for the range next value problem and applications | 2012-06-25 | Paper |
| Efficient algorithms for three variants of the LPF table | 2012-05-11 | Paper |
| Approximation of RNA multiple structural alignment | 2012-01-04 | Paper |
| Efficient Seeds Computation Revisited | 2011-06-29 | Paper |
| Polynomial-Time Approximation Algorithms for Weighted LCS Problem | 2011-06-29 | Paper |
| Finding Patterns In Given Intervals | 2011-06-14 | Paper |
| On the Maximal Sum of Exponents of Runsin a String | 2011-05-19 | Paper |
| Improved induced matchings in sparse graphs | 2010-11-25 | Paper |
| Algorithms for Three Versions of the Shortest Common Superstring Problem | 2010-07-26 | Paper |
| On the Maximal Number of Cubic Runs in a String | 2010-05-26 | Paper |
| Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays | 2010-01-28 | Paper |
| Improved Induced Matchings in Sparse Graphs | 2010-01-14 | Paper |
| LPF Computation Revisited | 2009-12-11 | Paper |
| On the Maximal Number of Cubic Subwords in a String | 2009-12-11 | Paper |
| Reversal distance for strings with duplicates: linear time approximation using hitting set | 2009-04-07 | Paper |
| Algorithms for Computing the Longest Parameterized Common Subsequence | 2008-06-17 | Paper |
| Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set | 2008-02-21 | Paper |
| RNA multiple structural alignment with longest common subsequences | 2007-10-12 | Paper |
| Approximation of RNA Multiple Structural Alignment | 2007-09-14 | Paper |
| Approximating reversal distance for strings with bounded number of duplicates | 2007-03-02 | Paper |
