| Publication | Date of Publication | Type |
|---|
| Optimal parallel algorithms for periods, palindromes and squares | 2019-12-04 | Paper |
| Graph compression by BFS | 2018-08-20 | Paper |
| String cadences | 2017-11-06 | Paper |
| Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings | 2017-02-06 | Paper |
| Efficient Alignment Free Sequence Comparison with Bounded Mismatches | 2016-06-22 | Paper |
| Sequence similarity measures based on bounded Hamming distance | 2016-06-16 | Paper |
| A PTAS for the square tiling problem | 2014-12-02 | Paper |
| Range LCP | 2014-06-10 | Paper |
| Modulated string searching | 2014-03-13 | Paper |
| Detecting approximate periodic patterns | 2014-03-13 | Paper |
| Efficient algorithms for the periodic subgraphs mining problem | 2013-06-24 | Paper |
| Detecting Approximate Periodic Patterns | 2013-04-19 | Paper |
| Speedup for a periodic subgraph miner | 2013-03-28 | Paper |
| Parameterized searching with mismatches for run-length encoded strings | 2012-10-11 | Paper |
| Range LCP | 2011-12-16 | Paper |
| OPTIMAL EXTRACTION OF IRREDUNDANT MOTIF BASES | 2011-01-19 | Paper |
| Maximal Words in Sequence Comparisons Based on Subword Composition | 2010-05-04 | Paper |
| Ask not what stringology can do for you: advances in pattern matching driven by computational biology | 2010-04-15 | Paper |
| The subsequence composition of a string | 2009-10-09 | Paper |
| Discovering subword associations in strings in time linear in the output size | 2009-06-24 | Paper |
| Optimal Offline Extraction of Irredundant Motif Bases | 2009-03-06 | Paper |
| Bridging Lossy and Lossless Compression by Motif Pattern Discovery | 2009-01-22 | Paper |
| Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time | 2008-12-12 | Paper |
| Periodicity and repetitions in parameterized strings | 2008-09-29 | Paper |
| Scoring unusual words with varying mismatch errors | 2008-09-08 | Paper |
| Parameterized matching with mismatches | 2008-05-16 | Paper |
| Motif patterns in 2D | 2008-03-05 | Paper |
| Fast gapped variants for Lempel-Ziv-Welch compression | 2007-07-16 | Paper |
| Bridging Lossy and Lossless Compression by Motif Pattern Discovery | 2007-05-29 | Paper |
| Periodicity and Repetitions in Parameterized Strings | 2007-05-29 | Paper |
| Motif discovery by monotone scores | 2007-04-18 | Paper |
| Optimal discovery of repetitions in 2D | 2005-11-07 | Paper |
| Discovery Science | 2005-08-18 | Paper |
| Efficient text fingerprinting via Parikh mapping | 2004-08-06 | Paper |
| Truncated suffix trees and their application to data compression. | 2003-08-17 | Paper |
| A speed-up for the commute between subword trees and DAWGs. | 2003-01-21 | Paper |
| Compact recognizers of episode sequences | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552045 | 2002-11-11 | Paper |
| Fibonacci arrays and their two-dimensional repetitions | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942631 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246781 | 1999-06-16 | Paper |
| Matching for run-length encoded strings | 1999-05-11 | Paper |
| Inverse Pattern Matching | 1997-10-20 | Paper |
| Parallel detection of all palindromes in a string | 1997-02-28 | Paper |
| An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String | 1997-02-24 | Paper |
| Data structures and algorithms for the string statistics problem | 1996-05-27 | Paper |
| Fast parallel Lyndon factorization with applications | 1995-04-05 | Paper |
| The Set Union Problem with Unlimited Backtracking | 1994-12-21 | Paper |
| Efficient detection of quasiperiodicities in strings | 1993-11-28 | Paper |
| Erratum to: New clique and independent set algorithms for circle graphs | 1993-05-16 | Paper |
| Efficient CRCW-PRAM algorithms for universal substring searching | 1993-05-16 | Paper |
| Self-alignments in words and their applications | 1993-01-16 | Paper |
| Optimal parallel detection of squares in strings | 1992-09-27 | Paper |
| Optimal canonization of all substrings of a string | 1992-06-28 | Paper |
| New clique and independent set algorithms for circle graphs | 1992-06-28 | Paper |
| Optimal superprimitivity testing for strings | 1991-01-01 | Paper |
| Efficient Parallel Algorithms for String Editing and Related Problems | 1990-01-01 | Paper |
| Parallel construction of a suffix tree with applications | 1988-01-01 | Paper |
| The longest common subsequence problem revisited | 1987-01-01 | Paper |
| Finding maximum cliques on circular-arc graphs | 1987-01-01 | Paper |
| Robust transmission of unbounded strings using Fibonacci representations | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782811 | 1987-01-01 | Paper |
| Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings | 1986-01-01 | Paper |
| The Boyer–Moore–Galil String Searching Strategies Revisited | 1986-01-01 | Paper |
| Structural properties of the string statistics problem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3690245 | 1985-01-01 | Paper |
| Systolic Algorithms for String Manipulations | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3332275 | 1984-01-01 | Paper |
| Optimal off-line detection of repetitions in a string | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3969895 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3723739 | 1979-01-01 | Paper |
| C-calculus: An elementary approach to some problems in pattern recognition | 1978-01-01 | Paper |
