| Publication | Date of Publication | Type |
|---|
Matching statistics -- a survey
Theoretical Computer Science | 2026-03-26 | Paper |
On the number of equal-letter runs of the bijective Burrows-Wheeler transform
Theoretical Computer Science | 2025-01-08 | Paper |
| Suffix sorting via matching statistics | 2024-08-13 | Paper |
| A BWT-based algorithm for random de Bruijn sequence construction | 2024-05-31 | Paper |
| Constant time and space updates for the sigma-tau problem | 2024-05-29 | Paper |
\(r\)-indexing the eBWT
Information and Computation | 2024-05-24 | Paper |
| A theoretical and experimental analysis of BWT variants for string collections | 2024-05-06 | Paper |
Bit catastrophes for the Burrows-Wheeler transform
Developments in Language Theory | 2023-11-16 | Paper |
| Pattern discovery in colored strings | 2023-02-07 | Paper |
Pattern discovery in colored strings
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
| r-indexing the eBWT | 2022-06-15 | Paper |
Computing the original eBWT faster, simpler, and with less memory
(available as arXiv preprint) | 2022-06-15 | Paper |
Novel results on the number of runs of the Burrows-Wheeler-transform
(available as arXiv preprint) | 2022-03-24 | Paper |
On infinite prefix normal words
Theoretical Computer Science | 2021-02-15 | Paper |
When a dollar makes a BWT
Theoretical Computer Science | 2021-01-25 | Paper |
On infinite prefix normal words
SOFSEM 2019: Theory and Practice of Computer Science | 2020-10-22 | Paper |
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
Theoretical Computer Science | 2020-10-12 | Paper |
Bubble-flip -- a new generation algorithm for prefix normal words
Theoretical Computer Science | 2018-08-23 | Paper |
Bubble-flip -- a new generation algorithm for prefix normal words
Language and Automata Theory and Applications | 2018-06-26 | Paper |
| Reconstruction of trees from jumbled and weighted subtrees | 2017-10-17 | Paper |
On prefix normal words and prefix normal forms
Theoretical Computer Science | 2016-12-23 | Paper |
On the number of closed factors in a word
Language and Automata Theory and Applications | 2016-04-08 | Paper |
On combinatorial generation of prefix normal words
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Binary jumbled string matching for highly run-length compressible texts
Information Processing Letters | 2014-04-11 | Paper |
Efficient algorithms for the periodic subgraphs mining problem
Journal of Discrete Algorithms | 2013-06-24 | Paper |
On approximate jumbled pattern matching in strings
Theory of Computing Systems | 2012-12-06 | Paper |
A linear algorithm for string reconstruction in the reverse complement equivalence model
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Algorithms for jumbled pattern matching in strings
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
On prefix normal words
Developments in Language Theory | 2011-07-29 | Paper |
Efficient Reconstruction of RC-Equivalent Strings
Lecture Notes in Computer Science | 2011-05-19 | Paper |
A fast and simple algorithm for the money changing problem
Algorithmica | 2007-09-10 | Paper |
Finding submasses in weighted strings with fast Fourier transform
Discrete Applied Mathematics | 2007-04-18 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithmic complexity of protein identification: Combinatorics of weighted strings
Discrete Applied Mathematics | 2004-02-14 | Paper |
