| Publication | Date of Publication | Type |
|---|
| Approximate Cartesian tree matching: an approach using swaps | 2024-05-29 | Paper |
| Fast Cartesian tree matching | 2024-04-19 | Paper |
| Speeding up two string-matching algorithms | 2022-08-18 | Paper |
| 125 problems in text algorithms. With solutions | 2021-04-06 | Paper |
| Fast algorithms for single and multiple pattern Cartesian tree matching | 2020-12-15 | Paper |
| Algorithms for indexing highly similar DNA sequences | 2020-08-07 | Paper |
| Fast multiple pattern Cartesian tree matching | 2020-07-22 | Paper |
| Fast string matching for DNA sequences | 2020-02-20 | Paper |
| Linking indexing data structures to de Bruijn graphs: construction and update | 2019-06-25 | Paper |
| A survey of string orderings and their application to the Burrows-Wheeler transform | 2018-02-16 | Paper |
| FM-index of alignment with gaps | 2018-02-16 | Paper |
| On-line string matching in highly similar DNA sequences | 2017-07-17 | Paper |
| Fast computation of abelian runs | 2017-02-06 | Paper |
| Binary block order Rouen transform | 2017-02-06 | Paper |
| A note on easy and efficient computation of full abelian periods of a word | 2016-09-12 | Paper |
| FM-index of alignment: a compressed index for similar strings | 2016-06-16 | Paper |
| A faster linear systolic algorithm for recovering a longest common subsequence | 2016-06-01 | Paper |
| Tight bounds on the complexity of the Apostolico-Giancarlo algorithm | 2016-05-26 | Paper |
| Abelian powers and repetitions in Sturmian words | 2016-05-26 | Paper |
| Online computation of abelian runs | 2016-04-08 | Paper |
| Construction of a de Bruijn graph for assembly from a truncated suffix tree | 2016-04-08 | Paper |
| Reducing the structure space of Bayesian classifiers using some general algorithms | 2015-12-01 | Paper |
| Algorithms for computing abelian periods of words | 2015-09-22 | Paper |
| Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks | 2015-06-02 | Paper |
| Algorithms on strings. Translated from the 2001 French original | 2014-10-23 | Paper |
| The exact online string matching problem: a review of the most recent results | 2014-08-13 | Paper |
| From indexing data structures to de Bruijn graphs | 2014-06-30 | Paper |
| Linear computation of unbordered conjugate on unordered alphabet | 2014-01-24 | Paper |
| Abelian repetitions in Sturmian words | 2013-06-28 | Paper |
| A fast suffix automata based algorithm for exact online string matching | 2012-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3570040 | 2010-06-23 | Paper |
| Dynamic extended suffix arrays | 2010-05-25 | Paper |
| Fast exact string matching algorithms | 2010-01-29 | Paper |
| Efficient variants of the backward-oracle-matching algorithm | 2010-01-08 | Paper |
| A four-stage algorithm for updating a Burrows-Wheeler transform | 2009-10-09 | Paper |
| Efficient validation and construction of border arrays and validation of string matching automata | 2009-05-06 | Paper |
| On special families of morphisms related to \(\delta \)-matching and don't care symbols | 2009-03-23 | Paper |
| On-line construction of compact suffix vectors and maximal repeats | 2008-11-18 | Paper |
| Alignments and approximate string matching | 2008-09-25 | 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 |
| A unifying look at the Apostolico--Giancarlo string-matching algorithm | 2007-04-26 | Paper |
| From Suffix Trees to Suffix Vectors | 2007-02-08 | Paper |
| Border array on bounded alphabet | 2006-02-06 | Paper |
| Linear-time computation of local periods | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820873 | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737699 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432970 | 2003-12-15 | Paper |
| Compror: On-line lossless data compression with a factor oracle. | 2003-01-21 | Paper |
| Fast practical multi-pattern matching | 2002-07-25 | Paper |
| A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences | 2002-01-01 | Paper |
| Speeding up two string-matching algorithms | 1996-02-26 | Paper |
| A variation on the Boyer-Moore algorithm | 1992-09-26 | Paper |
