| Publication | Date of Publication | Type |
|---|
| Back-to-front online Lyndon forest construction | 2024-05-06 | Paper |
| Linear-time computation of shortest covers of all rotations of a string | 2024-05-06 | Paper |
| Fast detection of specific fragments against a set of sequences | 2023-11-16 | Paper |
| On extended special factors of a word | 2023-07-28 | Paper |
| Internal Quasiperiod Queries | 2022-12-22 | Paper |
| Checking whether a word is Hamming-isometric in linear time | 2022-09-27 | Paper |
| Speeding up two string-matching algorithms | 2022-08-18 | Paper |
| On linear-time alphabet-independent 2-dimensional pattern matching | 2022-08-16 | Paper |
| Quasi-Linear-Time Algorithm for Longest Common Circular Factor | 2022-07-18 | Paper |
| Linear construction of a left Lyndon tree | 2022-06-08 | Paper |
| Shortest covers of all cyclic shifts of a string | 2021-04-14 | Paper |
| 125 Problems in Text Algorithms | 2021-04-06 | Paper |
| Linear-Time Algorithm for Long LCF with k Mismatches | 2020-12-16 | Paper |
| Shortest covers of all cyclic shifts of a string | 2020-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111799 | 2020-05-27 | Paper |
| Absent words in a sliding window with applications | 2020-01-17 | Paper |
| Cartesian and Lyndon trees | 2020-01-16 | Paper |
| Optimal bounds for computing \({\alpha}\)-gapped repeats | 2019-09-17 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2019-06-06 | Paper |
| Near-optimal computation of runs over general alphabet via non-crossing LCE queries | 2018-10-17 | Paper |
| Alignment-free sequence comparison using absent words | 2018-09-27 | Paper |
| Longest previous non-overlapping factors table computation | 2018-03-26 | Paper |
| Two-dimensional pattern matching in linear time and small space | 2017-12-04 | Paper |
| Minimal absent words in a sliding window and applications to on-line pattern matching | 2017-11-22 | 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 |
| Locating maximal approximate runs in a string | 2017-10-17 | Paper |
| Text redundancies | 2017-10-06 | Paper |
| Periodic-Finite-Type Shift Spaces | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978301 | 2017-04-21 | Paper |
| The longest common substring problem | 2017-04-04 | Paper |
| On the density of Lyndon roots in factors | 2017-02-06 | Paper |
| Efficient computation of maximal anti-exponent in palindrome-free strings | 2017-02-06 | Paper |
| Indexing a sequence for mapping reads with a single mismatch | 2017-01-13 | Paper |
| Counting maximal-exponent factors in words | 2016-12-19 | Paper |
| Order-preserving indexing | 2016-06-16 | Paper |
| Linear-size suffix tries | 2016-06-16 | Paper |
| Automata and forbidden words | 2016-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2809942 | 2016-05-30 | Paper |
| Tight bounds on the complexity of the Apostolico-Giancarlo algorithm | 2016-05-26 | Paper |
| Linear-Time Sequence Comparison Using Minimal Absent Words & Applications | 2016-05-03 | Paper |
| Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats | 2016-04-13 | Paper |
| Finite-Repetition threshold for infinite ternary words | 2016-03-01 | Paper |
| Computing maximal-exponent factors in an overlap-free word | 2015-12-30 | 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 |
| A note on the longest common compatible prefix problem for partial words | 2015-08-24 | Paper |
| Computing the Burrows-Wheeler transform in place and in small space | 2015-05-04 | Paper |
| Infinite binary words containing repetitions of odd period | 2015-04-02 | Paper |
| Finite repetition threshold for large alphabets | 2014-12-12 | Paper |
| Algorithms on Strings | 2014-10-23 | Paper |
| A comparison of index-based lempel-Ziv LZ77 factorization algorithms | 2014-08-13 | Paper |
| Abelian borders in binary words | 2014-05-06 | Paper |
| On the average number of regularities in a word | 2014-03-13 | Paper |
| Note on the greedy parsing optimality for dictionary-based text compression | 2014-03-13 | Paper |
| Extracting powers and periods in a word from its runs structure | 2014-01-22 | Paper |
| Suffix Tree of Alignment: An Efficient Index for Similar Data | 2014-01-17 | Paper |
| Efficient seed computation revisited | 2014-01-09 | Paper |
| On left and right seeds of a string | 2013-06-24 | Paper |
| Locating All Maximal Approximate Runs in a String | 2013-06-14 | Paper |
| A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform | 2013-06-14 | Paper |
| IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS | 2013-06-06 | Paper |
| Computing longest previous non-overlapping factors | 2013-04-04 | Paper |
| Computing all subtree repeats in ordered trees | 2013-03-21 | Paper |
| A note on efficient computation of all abelian periods in a string | 2013-03-20 | Paper |
| Understanding maximal repetitions in strings | 2013-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910720 | 2013-03-19 | Paper |
| Computing the longest previous factor | 2012-11-15 | Paper |
| The maximal number of cubic runs in a word | 2012-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2915603 | 2012-09-18 | Paper |
| On the maximal sum of exponents of runs in a string | 2012-09-13 | Paper |
| Dictionary-symbolwise flexible parsing | 2012-09-13 | Paper |
| Fewest repetitions in infinite binary words | 2012-08-31 | Paper |
| ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS | 2012-08-30 | Paper |
| The Maximum Number of Squares in a Tree | 2012-08-14 | Paper |
| Using minimal absent words to build phylogeny | 2012-08-09 | 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 |
| REVERSE ENGINEERING PREFIX TABLES | 2012-04-24 | Paper |
| On the Right-Seed Array of a String | 2011-08-17 | Paper |
| Hunting Redundancies in Strings | 2011-07-29 | Paper |
| Building Phylogeny with Minimal Absent Words | 2011-07-29 | Paper |
| Efficient Seeds Computation Revisited | 2011-06-29 | Paper |
| The ``runs conjecture | 2011-06-16 | Paper |
| Finding Patterns In Given Intervals | 2011-06-14 | Paper |
| On the Maximal Sum of Exponents of Runsin a String | 2011-05-19 | Paper |
| Dictionary-Symbolwise Flexible Parsing | 2011-05-19 | Paper |
| Reactive automata | 2011-04-28 | Paper |
| Fast computation of a longest increasing subsequence and application | 2010-10-07 | Paper |
| NUMBER OF OCCURRENCES OF POWERS IN STRINGS | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576753 | 2010-08-02 | Paper |
| Cover Array String Reconstruction | 2010-07-26 | Paper |
| Algorithms for Three Versions of the Shortest Common Superstring Problem | 2010-07-26 | Paper |
| Optimal prefix and suffix queries on texts | 2010-06-09 | Paper |
| On the Maximal Number of Cubic Runs in a String | 2010-05-26 | Paper |
| A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches | 2010-05-04 | Paper |
| Computing longest previous factor in linear time and applications | 2010-04-19 | Paper |
| Two-Dimensional Pattern Matching with Rotations | 2010-04-06 | Paper |
| String Processing and Information Retrieval | 2010-02-09 | Paper |
| Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays | 2010-01-28 | Paper |
| LPF Computation Revisited | 2009-12-11 | Paper |
| Repetitions in strings: algorithms and combinatorics | 2009-11-06 | Paper |
| From Nerode's congruence to suffix automata with mismatches | 2009-09-14 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Waiting time and complexity for matching patterns with automata | 2009-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5506326 | 2009-01-28 | Paper |
| Presentations of Constrained Systems With Unconstrained Positions | 2008-12-21 | Paper |
| Bounds on Powers in Strings | 2008-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3527015 | 2008-09-25 | Paper |
| Analysis of Maximal Repetitions in Strings | 2008-09-17 | Paper |
| Finding Patterns in Given Intervals | 2008-09-17 | Paper |
| Approximating the 2-interval pattern problem | 2008-07-10 | Paper |
| Maximal repetitions in strings | 2008-06-26 | Paper |
| Towards a Solution to the “Runs” Conjecture | 2008-06-17 | Paper |
| On the Suffix Automaton with Mismatches | 2008-06-10 | Paper |
| THE STRUCTURE OF FACTOR ORACLES | 2008-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5458488 | 2008-04-15 | Paper |
| Algorithms on Strings | 2008-02-22 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Factor Oracles | 2007-09-06 | Paper |
| A unifying look at the Apostolico--Giancarlo string-matching algorithm | 2007-04-26 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| Longest repeats with a block of \(k\) don't cares | 2006-10-20 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata | 2005-10-27 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| A note on the Burrows-Wheeler transformation | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829001 | 2004-11-29 | Paper |
| Two-dimensional pattern matching with rotations | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737699 | 2004-08-11 | Paper |
| Directed acyclic subsequence graph -- overview | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471991 | 2004-08-03 | Paper |
| Jewels of Stringology | 2004-02-23 | Paper |
| A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432970 | 2003-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432974 | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432976 | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430284 | 2003-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418628 | 2003-08-11 | Paper |
| Algorithms For Computing Approximate Repetitions In Musical Sequences | 2003-02-06 | Paper |
| Reducing space for index implementation. | 2003-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552045 | 2002-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552402 | 2002-09-02 | Paper |
| Fast practical multi-pattern matching | 2002-07-25 | Paper |
| A fast and practical bit-vector algorithm for the longest common subsequence problem | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150181 | 2002-01-01 | Paper |
| Computing evolutionary chains in musical sequences | 2001-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708252 | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496245 | 2000-08-13 | Paper |
| Constant-space string-matching in sublinear average time | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218144 | 1998-11-11 | Paper |
| Two-dimensional prefix string matching and covering on square matrices | 1998-05-24 | Paper |
| Constant-Time Randomized Parallel String Matching | 1998-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858437 | 1996-04-09 | Paper |
| Speeding up two string-matching algorithms | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4849531 | 1995-10-03 | Paper |
| Squares, cubes, and time-space efficient string searching | 1995-08-09 | Paper |
| Fast parallel Lyndon factorization with applications | 1995-04-05 | Paper |
| Two-way string-matching | 1994-09-29 | Paper |
| On two-dimensional pattern matching by optimal parallel algorithms | 1994-09-25 | Paper |
| Two-dimensional pattern matching by sampling | 1993-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027623 | 1993-02-21 | Paper |
| MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT | 1993-02-08 | Paper |
| String-matching on ordered alphabets | 1992-09-26 | Paper |
| A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) | 1992-09-26 | Paper |
| Optimal canonization of all substrings of a string | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976032 | 1992-06-26 | Paper |
| Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays | 1992-06-26 | Paper |
| Efficient parallel algorithms to test square-freeness and factorize strings | 1992-06-26 | Paper |
| On the parallel recognition of unambiguous context-free languages | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355232 | 1990-01-01 | Paper |
| Parallel construction of minimal suffix and factor automata | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3468609 | 1989-01-01 | Paper |
| Thue-Morse sequence and p-adic topology for the free monoid | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809299 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817621 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832063 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758253 | 1987-01-01 | Paper |
| Calcul de la distance par les sous-mots | 1986-01-01 | Paper |
| Transducers and repetitions | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692898 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3673134 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677190 | 1983-01-01 | Paper |
| An optimal test on finite unavoidable sets of words | 1983-01-01 | Paper |
| Mots Et Morphismes Sans Carré | 1983-01-01 | Paper |
| Sharp characterizations of squarefree morphisms | 1982-01-01 | Paper |
| An optimal algorithm for computing the repetitions in a word | 1981-01-01 | Paper |
