| Publication | Date of Publication | Type |
|---|
| Maximal closed substrings | 2023-08-04 | Paper |
| Abelian combinatorics on words: a survey | 2023-06-20 | Paper |
| On the Lie complexity of Sturmian words | 2022-10-24 | Paper |
| Reverse-Safe Text Indexing | 2022-09-06 | Paper |
| Properties of a class of Toeplitz words | 2022-06-13 | Paper |
| On the Lie complexity of Sturmian words | 2022-06-02 | Paper |
| Adaptive learning of compressible strings | 2021-11-18 | Paper |
| Constructing antidictionaries of long texts in output-sensitive space | 2021-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986320 | 2021-04-27 | Paper |
| Primitive sets of words | 2021-04-14 | Paper |
| Reverse-Safe Data Structures for Text Indexing | 2021-01-27 | Paper |
| Generating a Gray code for prefix normal words in amortized polylogarithmic time per word | 2020-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207880 | 2020-01-13 | Paper |
| On sets of words of rank two | 2019-11-06 | Paper |
| Minimal forbidden factors of circular words | 2019-10-07 | Paper |
| Abelian antipowers in infinite words | 2019-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967241 | 2019-07-03 | Paper |
| Alignment-free sequence comparison using absent words | 2018-09-27 | Paper |
| Algorithms for anti-powers in strings | 2018-06-15 | Paper |
| Anti-powers in infinite words | 2018-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598266 | 2017-12-19 | Paper |
| Minimal forbidden factors of circular words | 2017-11-15 | Paper |
| The sequence of open and closed prefixes of a Sturmian word | 2017-07-13 | Paper |
| Abelian-square-rich words | 2017-06-15 | Paper |
| Cyclic complexity of words | 2017-02-09 | Paper |
| Fast computation of abelian runs | 2017-02-06 | Paper |
| On prefix normal words and prefix normal forms | 2016-12-23 | Paper |
| A note on easy and efficient computation of full abelian periods of a word | 2016-09-12 | Paper |
| Abelian powers and repetitions in Sturmian words | 2016-05-26 | Paper |
| Linear-Time Sequence Comparison Using Minimal Absent Words & Applications | 2016-05-03 | Paper |
| On the Number of Closed Factors in a Word | 2016-04-08 | Paper |
| Online Computation of Abelian Runs | 2016-04-08 | Paper |
| A Classification of Trapezoidal Words | 2016-03-01 | Paper |
| On the greedy algorithm for the shortest common superstring problem with reversals | 2016-01-05 | Paper |
| Words with the Maximum Number of Abelian Squares | 2015-11-04 | Paper |
| Algorithms for computing abelian periods of words | 2015-09-22 | Paper |
| Factorizations of the Fibonacci Infinite Word | 2015-08-18 | Paper |
| Vertical representation of \(\mathbf{C}^\infty\)-words | 2014-12-22 | Paper |
| Universal Lyndon Words | 2014-10-14 | Paper |
| Cyclic Complexity of Words | 2014-10-14 | Paper |
| A subquadratic algorithm for minimum palindromic factorization | 2014-09-05 | Paper |
| On Combinatorial Generation of Prefix Normal Words | 2014-06-30 | Paper |
| Binary jumbled string matching for highly run-length compressible texts | 2014-04-11 | Paper |
| On the structure of bispecial Sturmian words | 2014-02-13 | Paper |
| On the least number of palindromes contained in an infinite word | 2013-11-29 | Paper |
| Open and Closed Prefixes of Sturmian Words | 2013-09-20 | Paper |
| Abelian Repetitions in Sturmian Words | 2013-06-28 | Paper |
| Enumeration and structure of trapezoidal words | 2013-02-19 | Paper |
| On approximate jumbled pattern matching in strings | 2012-12-06 | Paper |
| A Characterization of Bispecial Sturmian Words | 2012-09-25 | Paper |
| ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS | 2012-08-30 | Paper |
| Automata and differentiable words | 2012-08-10 | Paper |
| On Prefix Normal Words | 2011-07-29 | Paper |
| Special factors and the combinatorics of suffix and factor automata | 2011-07-14 | Paper |
| On the regularity of circular splicing languages: a survey and new developments | 2010-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3550124 | 2010-03-30 | Paper |
| A characterization of regular circular languages generated by marked splicing systems | 2009-11-06 | Paper |
| Combinatorics of Finite Words and Suffix Automata | 2009-11-05 | Paper |
| Presentations of Constrained Systems With Unconstrained Positions | 2008-12-21 | Paper |
| Marked Systems and Circular Splicing | 2008-02-26 | Paper |
| Word assembly through minimal forbidden words | 2006-09-14 | Paper |
