| Publication | Date of Publication | Type |
|---|
| On the optimisation of the GSACA suffix array construction algorithm | 2023-08-04 | Paper |
| Trickier XBWT tricks | 2023-07-28 | Paper |
| Combinations of simplifying conditional term rewriting systems | 2023-03-09 | Paper |
| Edge minimization in de Bruijn graphs | 2022-06-08 | Paper |
| Fast and Lightweight LCP-Array Construction Algorithms | 2019-09-12 | Paper |
| Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies | 2017-07-03 | Paper |
| Alphabet-independent algorithms for finding context-sensitive repeats in linear time | 2015-08-24 | Paper |
| Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis | 2015-08-20 | Paper |
| Compressed suffix trees | 2015-03-16 | Paper |
| Computing the Burrows-Wheeler transform of a string and its reverse in parallel | 2014-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5397902 | 2014-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843935 | 2013-08-27 | Paper |
| Computing the longest common prefix array based on the Burrows-Wheeler transform | 2013-06-24 | Paper |
| Computing the Burrows-Wheeler Transform of a String and Its Reverse | 2012-08-14 | Paper |
| Bidirectional search in a string with wavelet trees and bidirectional matching statistics | 2012-05-24 | Paper |
| Lempel-Ziv Factorization Revisited | 2011-06-29 | Paper |
| Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem | 2010-09-02 | Paper |
| Bidirectional Search in a String with Wavelet Trees | 2010-07-26 | Paper |
| Multiple Genome Alignment: Chaining Algorithms Revisited | 2010-04-06 | Paper |
| A Compressed Enhanced Suffix Array Supporting Fast String Matching | 2009-09-29 | Paper |
| A linear time algorithm for the inversion median problem in circular bacterial genomes | 2008-05-29 | Paper |
| Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions | 2007-08-30 | Paper |
| Replacing suffix trees with enhanced suffix arrays | 2007-04-26 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Chaining algorithms for multiple genome comparison | 2005-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431370 | 2003-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431349 | 2003-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410161 | 2003-07-02 | Paper |
| Hierarchical termination revisited. | 2003-01-21 | Paper |
| Relative undecidability in term rewriting. I: The termination hierarchy | 2003-01-14 | Paper |
| Relative undecidability in term rewriting. II: The confluence hierarchy | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766779 | 2002-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2783416 | 2002-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2782485 | 2002-04-03 | Paper |
| Implementing conditional term rewriting by graph rewriting | 2002-03-03 | Paper |
| Termination of logic programs: Transformational methods revisited | 2001-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723909 | 2001-07-08 | Paper |
| A uniform framework for term and graph rewriting applied to combined systems | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506400 | 2000-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954455 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938421 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223786 | 1999-03-11 | Paper |
| On the equivalence problem for E-pattern languages | 1998-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362915 | 1998-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364374 | 1997-11-17 | Paper |
| Termination is not modular for confluent variable-preserving term rewriting systems | 1997-02-28 | Paper |
| On the modularity of termination of term rewriting systems | 1997-02-27 | Paper |
| Modular properties of composable term rewriting systems | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3970985 | 1992-06-25 | Paper |
