| Publication | Date of Publication | Type |
|---|
| A new class of string transformations for compressed text indexing | 2023-09-27 | Paper |
| An index data structure for matrices, with applications to fast two-dimensional pattern matching | 2023-01-18 | Paper |
| A new class of searchable and provably highly compressible string transformations | 2022-07-18 | Paper |
| On-line construction of two-dimensional suffix trees | 2021-12-20 | Paper |
| The alternating BWT: an algorithmic perspective | 2020-02-20 | Paper |
| DNA combinatorial messages and epigenomics: the case of chromatin organization and nucleosome occupancy in eukaryotic genomes | 2019-10-07 | Paper |
| On the construction of classes of suffix trees for square matrices: Algorithms and applications | 2019-01-10 | Paper |
| Block sorting-based transformations on words: beyond the magic BWT | 2018-11-22 | Paper |
| Improving table compression with combinatorial optimization | 2015-11-12 | Paper |
| Textual data compression in computational biology: algorithmic techniques | 2014-10-24 | Paper |
| Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3588790 | 2010-09-10 | Paper |
| Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms | 2010-04-06 | Paper |
| The myriad virtues of wavelet trees | 2009-07-15 | Paper |
| The Myriad Virtues of Wavelet Trees | 2009-03-12 | Paper |
| Boosting textual compression in optimal linear time | 2008-12-21 | Paper |
| New results for finding common neighborhoods in massive graphs in the data stream model | 2008-11-18 | Paper |
| Periodicity and repetitions in parameterized strings | 2008-09-29 | Paper |
| A tutorial on computational cluster analysis with applications to pattern discovery in microarray data | 2008-09-08 | Paper |
| The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression | 2008-03-11 | Paper |
| From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization | 2007-12-19 | Paper |
| On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time | 2007-10-10 | Paper |
| Periodicity and Repetitions in Parameterized Strings | 2007-05-29 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828934 | 2004-11-29 | Paper |
| On finding common neighborhoods in massive graphs. | 2003-05-25 | Paper |
| Sparse Dynamic Programming for Longest Common Subsequence from Fragments | 2002-07-11 | Paper |
| An approximate determinization algorithm for weighted finite-state automata | 2001-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723937 | 2001-07-08 | Paper |
| On the Determinization of Weighted Finite Automata | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954446 | 2000-06-07 | Paper |
| On-line construction of two-dimensional suffix trees | 1999-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252024 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246781 | 1999-06-16 | Paper |
| Parallel construction and query of index data structures for pattern matching on square matrices | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219042 | 1998-11-15 | Paper |
| Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms | 1998-06-11 | Paper |
| On the construction of classes of suffix trees for square matrices: Algorithms and applications | 1997-03-06 | Paper |
| A Generalization of the Suffix Tree to Square Matrices, with Applications | 1996-03-18 | Paper |
| Dynamic dictionary matching | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858443 | 1995-12-13 | Paper |
| Sparse dynamic programming II | 1995-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140444 | 1994-11-29 | Paper |
| Sparse dynamic programming I | 1994-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138931 | 1993-12-15 | Paper |
| On the Exact Complexity of String Matching: Upper Bounds | 1993-01-16 | Paper |
| On the Exact Complexity of String Matching: Lower Bounds | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206397 | 1990-01-01 | Paper |
| Speeding up dynamic programming with applications to molecular biology | 1989-01-01 | Paper |
| Data structures and algorithms for approximate string matching | 1988-01-01 | Paper |
| Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa | 1988-01-01 | Paper |
| Optimal parallel parsing of bracket languages | 1987-01-01 | Paper |
| Parallel string matching with k mismatches | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3765260 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779733 | 1987-01-01 | Paper |
| The Boyer–Moore–Galil String Searching Strategies Revisited | 1986-01-01 | Paper |
| Bounds on the redundancy of Huffman codes (Corresp.) | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747742 | 1985-01-01 | Paper |
