| Publication | Date of Publication | Type |
|---|
| On the impact of morphisms on BWT-runs | 2024-10-21 | Paper |
New string attractor-based complexities for infinite words
Journal of Combinatorial Theory. Series A | 2024-09-30 | Paper |
\(r\)-indexing the eBWT
Information and Computation | 2024-05-24 | Paper |
| Inducing the Lyndon array | 2024-04-19 | Paper |
Bit catastrophes for the Burrows-Wheeler transform
Developments in Language Theory | 2023-11-16 | Paper |
A new class of string transformations for compressed text indexing
Information and Computation | 2023-09-27 | Paper |
The colored longest common prefix array computed via sequential scans
String Processing and Information Retrieval | 2023-07-28 | Paper |
String attractors and infinite words
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Logarithmic equal-letter runs for BWT of purely morphic words
(available as arXiv preprint) | 2022-08-11 | Paper |
Detecting mutations by eBWT
(available as arXiv preprint) | 2022-07-18 | Paper |
A new class of searchable and provably highly compressible string transformations
(available as arXiv preprint) | 2022-07-18 | 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 |
A combinatorial view on string attractors
Theoretical Computer Science | 2020-12-16 | Paper |
The alternating BWT: an algorithmic perspective
Theoretical Computer Science | 2020-02-20 | Paper |
| Block sorting-based transformations on words: beyond the magic BWT | 2018-11-22 | Paper |
On fixed points of the Burrows-Wheeler transform
Fundamenta Informaticae | 2018-01-19 | Paper |
| Burrows-Wheeler transform and run-length enconding | 2017-11-15 | Paper |
Measuring the clustering effect of BWT via RLE
Theoretical Computer Science | 2017-11-06 | Paper |
Cyclic complexity of words
Journal of Combinatorial Theory. Series A | 2017-02-09 | Paper |
Lightweight LCP construction for very large collections of strings
Journal of Discrete Algorithms | 2016-07-15 | Paper |
Standard Sturmian words and automata minimization algorithms
Theoretical Computer Science | 2015-09-16 | Paper |
Epichristoffel Words and Minimization of Moore Automata
Fundamenta Informaticae | 2015-06-26 | Paper |
Sorting conjugates and suffixes of words in a multiset
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Cyclic Complexity of Words
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Universal Lyndon words
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Suffix array and Lyndon factorization of a text
Journal of Discrete Algorithms | 2014-09-05 | Paper |
Words, trees and automata minimization
Lecture Notes in Computer Science | 2013-09-20 | Paper |
The Burrows-Wheeler transform between data compression and combinatorics on words
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Suffixes, conjugates and Lyndon words
Developments in Language Theory | 2013-06-28 | Paper |
Lightweight LCP Construction for Next-Generation Sequencing Datasets
Lecture Notes in Computer Science | 2013-04-26 | Paper |
Nondeterministic Moore automata and Brzozowski's minimization algorithm
Theoretical Computer Science | 2012-08-09 | Paper |
Nondeterministic Moore automata and Brzozowski's algorithm
Implementation and Application of Automata | 2011-07-29 | Paper |
Hopcroft's algorithm and tree-like automata
RAIRO - Theoretical Informatics and Applications | 2011-06-10 | Paper |
Hopcroft's algorithm and tree-like automata
RAIRO - Theoretical Informatics and Applications | 2011-06-10 | Paper |
A challenging family of automata for classical minimization algorithms
Implementation and Application of Automata | 2011-02-11 | Paper |
On extremal cases of Hopcroft's algorithm
Theoretical Computer Science | 2010-10-07 | Paper |
Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Distance measures for biological sequences: some recent approaches
International Journal of Approximate Reasoning | 2010-03-18 | Paper |
Circular Sturmian words and Hopcroft's algorithm
Theoretical Computer Science | 2009-10-09 | Paper |
On Extremal Cases of Hopcroft’s Algorithm
Implementation and Application of Automata | 2009-07-09 | Paper |
Burrows-Wheeler transform and Sturmian words
Information Processing Letters | 2009-03-23 | Paper |
Boosting textual compression in optimal linear time
Journal of the ACM | 2008-12-21 | Paper |
Hopcroft’s Algorithm and Cyclic Automata
Language and Automata Theory and Applications | 2008-11-20 | Paper |
A new combinatorial approach to sequence comparison
Theory of Computing Systems | 2008-04-11 | Paper |
An extension of the Burrows-Wheeler transform
Theoretical Computer Science | 2007-12-19 | Paper |
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
Theoretical Computer Science | 2007-12-19 | Paper |
Suffix Automata and Standard Sturmian Words
Developments in Language Theory | 2007-11-28 | Paper |
Languages with mismatches
Theoretical Computer Science | 2007-10-18 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Word assembly through minimal forbidden words
Theoretical Computer Science | 2006-09-14 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
| scientific article; zbMATH DE number 2087238 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2051173 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2011852 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 1998341 (Why is no real title available?) | 2003-10-29 | Paper |
Forbidden Factors and Fragment Assembly
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Forbidden Factors and Fragment Assembly
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Forbidden Factors and Fragment Assembly
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Words and forbidden factors
Theoretical Computer Science | 2002-07-15 | Paper |
Forbidden words in symbolic dynamics
Advances in Applied Mathematics | 2000-11-16 | Paper |
| scientific article; zbMATH DE number 1408358 (Why is no real title available?) | 2000-02-29 | Paper |
