| Publication | Date of Publication | Type |
|---|
| Suffix sorting via matching statistics | 2024-08-13 | Paper |
| Longest common prefix arrays for succinct \(k\)-spectra | 2024-05-29 | Paper |
| Computing longest Lyndon subsequences and longest common Lyndon subsequences | 2024-03-25 | Paper |
| Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads | 2023-08-04 | Paper |
| Maximal closed substrings | 2023-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6159899 | 2023-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098778 | 2023-06-14 | Paper |
| Fast and simple compact hashing via bucketing | 2023-02-07 | Paper |
| Pattern discovery in colored strings | 2023-02-07 | Paper |
| Relative Lempel-Ziv Compression of Suffix Arrays | 2022-12-22 | Paper |
| String inference from longest-common-prefix array | 2022-12-21 | Paper |
| Pattern discovery in colored strings | 2022-09-06 | Paper |
| Computing longest (common) Lyndon subsequences | 2022-08-30 | Paper |
| Fast and simple compact hashing via bucketing | 2022-08-18 | Paper |
| Computing the Antiperiod(s) of a String | 2022-07-18 | Paper |
| A succinct solution to Rmap alignment | 2022-07-18 | Paper |
| On suffix tree breadth | 2021-02-16 | Paper |
| On two LZ78-style grammars: compression bounds and compressed-space computation | 2021-02-16 | Paper |
| Block trees | 2021-02-02 | Paper |
| Tight upper and lower bounds on suffix tree breadth | 2021-01-25 | Paper |
| Lempel-Ziv-like parsing in small space | 2020-10-21 | Paper |
| String inference from longest-common-prefix array | 2020-05-27 | Paper |
| Disentangled long-read de Bruijn graphs via optical maps | 2020-05-27 | Paper |
| Hybrid indexing revisited | 2019-09-12 | Paper |
| Engineering External Memory Induced Suffix Sorting | 2019-09-12 | Paper |
| Lempel-Ziv factorization: simple, fast, practical | 2019-09-12 | Paper |
| Compact dynamic rewritable (CDRW) arrays | 2019-09-12 | Paper |
| Bidirectional Variable-Order de Bruijn Graphs | 2019-06-24 | Paper |
| m-Bonsai: a practical compact dynamic trie | 2019-06-24 | Paper |
| Fixed block compression boosting in FM-indexes: theory and practice | 2019-04-25 | Paper |
| RLZAP: relative Lempel-Ziv with adaptive pointers | 2018-10-17 | Paper |
| Analyzing relative Lempel-Ziv reference construction | 2018-10-17 | Paper |
| Longest common abelian factors and large alphabets | 2018-10-17 | Paper |
| Range predecessor and Lempel-Ziv parsing | 2018-07-16 | Paper |
| Algorithms for anti-powers in strings | 2018-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636645 | 2018-04-19 | Paper |
| Deterministic sub-linear space LCE data structures with efficient construction | 2017-10-17 | Paper |
| Block graphs in practice | 2017-07-17 | Paper |
| Lazy Lempel-Ziv factorization algorithms | 2017-06-16 | Paper |
| An efficient, versatile approach to suffix sorting | 2017-06-15 | Paper |
| Hybrid indexes for repetitive datasets | 2017-01-13 | Paper |
| General document retrieval in compact space | 2016-10-24 | Paper |
| Closed factorization | 2016-09-12 | Paper |
| Bidirectional variable-order de Bruijn graphs | 2016-05-03 | Paper |
| Access, rank, and select in grammar-compressed strings | 2015-11-19 | Paper |
| Diverse Palindromic Factorization Is NP-complete | 2015-11-10 | Paper |
| Parallel External Memory Suffix Sorting | 2015-08-20 | Paper |
| Approximate pattern matching in LZ77-compressed texts | 2015-05-04 | Paper |
| Relative Lempel-Ziv with constant-time random access | 2015-02-10 | Paper |
| Document retrieval on repetitive collections | 2014-10-08 | Paper |
| String range matching | 2014-06-30 | Paper |
| LZ77-based self-indexing with faster pattern matching | 2014-03-31 | Paper |
| Order-preserving matching | 2014-03-13 | Paper |
| Enhanced string covering | 2014-01-16 | Paper |
| Colored range queries and document retrieval | 2014-01-09 | Paper |
| Document listing on repetitive collections | 2013-06-14 | Paper |
| Linear Time Lempel-Ziv Factorization: Simple, Fast, Small | 2013-06-14 | Paper |
| A faster grammar-based self-index | 2012-06-08 | Paper |
| New algorithms on wavelet trees and applications to information retrieval | 2012-05-30 | Paper |
| Faster approximate pattern matching in compressed repetitive texts | 2011-12-16 | Paper |
| Fast, practical algorithms for computing all the repeats in a string | 2011-02-19 | Paper |
| Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval | 2010-10-22 | Paper |
| Medium-Space Algorithms for Inverse BWT | 2010-09-06 | Paper |
| Top-\(k\) ranked document search in general text databases | 2010-09-06 | Paper |
| Permuted Longest-Common-Prefix Array | 2009-07-07 | Paper |
| Testing Stream Ciphers by Finding the Longest Substring of a Given Density | 2009-06-25 | Paper |
| Words with simple Burrows-Wheeler transforms | 2009-04-07 | Paper |
| Space-Time Tradeoffs for Longest-Common-Prefix Array Computation | 2009-01-29 | Paper |
| The expected number of runs in a word | 2009-01-15 | Paper |
| Lempel-Ziv factorization using less time \& space | 2008-09-08 | Paper |
| How many runs can a string contain? | 2008-07-31 | Paper |
| Fast and Practical Algorithms for Computing All the Runs in a String | 2008-06-17 | Paper |
| A New Periodicity Lemma | 2007-09-06 | Paper |
