| Publication | Date of Publication | Type |
|---|
Quasi-linear-time algorithm for a longest common circular factor
Theoretical Computer Science | 2026-05-11 | Paper |
Internal quasiperiod queries
Theoretical Computer Science | 2026-02-12 | Paper |
| Back-to-front online Lyndon forest construction | 2024-05-06 | Paper |
| Linear-time computation of shortest covers of all rotations of a string | 2024-05-06 | Paper |
Fast detection of specific fragments against a set of sequences
Developments in Language Theory | 2023-11-16 | Paper |
On extended special factors of a word
String Processing and Information Retrieval | 2023-07-28 | Paper |
Internal Quasiperiod Queries
1511.681 | 2022-12-22 | Paper |
Checking whether a word is Hamming-isometric in linear time
Theoretical Computer Science | 2022-09-27 | Paper |
Speeding up two string-matching algorithms
STACS 92 | 2022-08-18 | Paper |
On linear-time alphabet-independent 2-dimensional pattern matching
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
(available as arXiv preprint) | 2022-07-18 | Paper |
Linear construction of a left Lyndon tree
Information and Computation | 2022-06-08 | Paper |
Shortest covers of all cyclic shifts of a string
Theoretical Computer Science | 2021-04-14 | Paper |
| 125 problems in text algorithms. With solutions | 2021-04-06 | Paper |
Linear-time algorithm for long LCF with k mismatches
(available as arXiv preprint) | 2020-12-16 | Paper |
Shortest covers of all cyclic shifts of a string
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
| scientific article; zbMATH DE number 7205098 (Why is no real title available?) | 2020-05-27 | Paper |
Absent words in a sliding window with applications
Information and Computation | 2020-01-17 | Paper |
Cartesian and Lyndon trees
Theoretical Computer Science | 2020-01-16 | Paper |
Optimal bounds for computing \({\alpha}\)-gapped repeats
Information and Computation | 2019-09-17 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
Near-optimal computation of runs over general alphabet via non-crossing LCE queries
(available as arXiv preprint) | 2018-10-17 | Paper |
Alignment-free sequence comparison using absent words
Information and Computation | 2018-09-27 | Paper |
Alignment-free sequence comparison using absent words
Information and Computation | 2018-09-27 | Paper |
| Longest previous non-overlapping factors table computation | 2018-03-26 | Paper |
Two-dimensional pattern matching in linear time and small space
STACS 95 | 2017-12-04 | Paper |
| Minimal absent words in a sliding window and applications to on-line pattern matching | 2017-11-22 | Paper |
Covering problems for partial words and for indeterminate strings
Theoretical Computer Science | 2017-11-06 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Locating maximal approximate runs in a string
Theoretical Computer Science | 2017-10-17 | Paper |
Text redundancies
Combinatorics, Words and Symbolic Dynamics | 2017-10-06 | Paper |
Periodic-Finite-Type Shift Spaces
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
| Quasiperiodicities in Fibonacci strings. | 2017-04-21 | Paper |
The longest common substring problem
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
On the density of Lyndon roots in factors
Theoretical Computer Science | 2017-02-06 | Paper |
Efficient computation of maximal anti-exponent in palindrome-free strings
Theoretical Computer Science | 2017-02-06 | Paper |
Indexing a sequence for mapping reads with a single mismatch
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Counting maximal-exponent factors in words
Theoretical Computer Science | 2016-12-19 | Paper |
Order-preserving indexing
Theoretical Computer Science | 2016-06-16 | Paper |
Linear-size suffix tries
Theoretical Computer Science | 2016-06-16 | Paper |
Automata and forbidden words
Information Processing Letters | 2016-06-09 | Paper |
On the appearance of seeds in words
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-05-30 | Paper |
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
Information Processing Letters | 2016-05-26 | Paper |
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Optimal bounds for computing -gapped repeats
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Finite-repetition threshold for infinite ternary words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Finite-repetition threshold for infinite ternary words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Computing maximal-exponent factors in an overlap-free word
Journal of Computer and System Sciences | 2015-12-30 | Paper |
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics | 2015-09-22 | Paper |
Covering problems for partial words and for indeterminate strings
Lecture Notes in Computer Science | 2015-09-11 | Paper |
A note on the longest common compatible prefix problem for partial words
Journal of Discrete Algorithms | 2015-08-24 | Paper |
Computing the Burrows-Wheeler transform in place and in small space
Journal of Discrete Algorithms | 2015-05-04 | Paper |
Infinite binary words containing repetitions of odd period
Information Processing Letters | 2015-04-02 | Paper |
Finite repetition threshold for large alphabets
RAIRO - Theoretical Informatics and Applications | 2014-12-12 | Paper |
| Algorithms on strings. Translated from the 2001 French original | 2014-10-23 | Paper |
A comparison of index-based Lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys | 2014-08-13 | Paper |
Abelian borders in binary words
Discrete Applied Mathematics | 2014-05-06 | Paper |
On the average number of regularities in a word
Theoretical Computer Science | 2014-03-13 | Paper |
Note on the greedy parsing optimality for dictionary-based text compression
Theoretical Computer Science | 2014-03-13 | Paper |
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science | 2014-01-22 | Paper |
Suffix tree of alignment: an efficient index for similar data
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Efficient seed computation revisited
Theoretical Computer Science | 2014-01-09 | Paper |
On left and right seeds of a string
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Locating all maximal approximate runs in a string
Combinatorial Pattern Matching | 2013-06-14 | Paper |
A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Identifying all abelian periods of a string in quadratic time and relevant problems
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
Computing longest previous non-overlapping factors
Information Processing Letters | 2013-04-04 | Paper |
Computing all subtree repeats in ordered trees
Information Processing Letters | 2013-03-21 | Paper |
A note on efficient computation of all abelian periods in a string
Information Processing Letters | 2013-03-20 | Paper |
Understanding maximal repetitions in strings
(available as arXiv preprint) | 2013-03-19 | Paper |
| Understanding maximal repetitions in strings | 2013-03-19 | Paper |
| scientific article; zbMATH DE number 6146456 (Why is no real title available?) | 2013-03-19 | Paper |
Computing the longest previous factor
European Journal of Combinatorics | 2012-11-15 | Paper |
The maximal number of cubic runs in a word
Journal of Computer and System Sciences | 2012-11-06 | Paper |
Medians of an odd number of permutations
PU.M.A. Pure Mathematics and Applications | 2012-09-18 | Paper |
On the maximal sum of exponents of runs in a string
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Dictionary-symbolwise flexible parsing
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Fewest repetitions in infinite binary words
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
Fewest repetitions in infinite binary words
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
On-line construction of a small automaton for a finite set of words
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
The maximum number of squares in a tree
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Using minimal absent words to build phylogeny
Theoretical Computer Science | 2012-08-09 | Paper |
Improved algorithms for the range next value problem and applications
Theoretical Computer Science | 2012-06-25 | Paper |
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms | 2012-05-11 | Paper |
| Reverse engineering prefix tables | 2012-04-24 | Paper |
On the right-seed array of a string
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Hunting redundancies in strings
Developments in Language Theory | 2011-07-29 | Paper |
Building phylogeny with minimal absent words
Implementation and Application of Automata | 2011-07-29 | Paper |
Efficient seeds computation revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
The ``runs'' conjecture
Theoretical Computer Science | 2011-06-16 | Paper |
Finding patterns in given intervals
Fundamenta Informaticae | 2011-06-14 | Paper |
On the Maximal Sum of Exponents of Runsin a String
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Dictionary-symbolwise flexible parsing
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Reactive automata
Information and Computation | 2011-04-28 | Paper |
Fast computation of a longest increasing subsequence and application
Information and Computation | 2010-10-07 | Paper |
NUMBER OF OCCURRENCES OF POWERS IN STRINGS
International Journal of Foundations of Computer Science | 2010-09-06 | Paper |
| Optimal prefix and suffix queries on texts | 2010-08-02 | Paper |
Cover array string reconstruction
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Algorithms for Three Versions of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Optimal prefix and suffix queries on texts
Information Processing Letters | 2010-06-09 | Paper |
On the maximal number of cubic runs in a string
Language and Automata Theory and Applications | 2010-05-26 | Paper |
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
Algorithms and Applications | 2010-05-04 | Paper |
Computing longest previous factor in linear time and applications
Information Processing Letters | 2010-04-19 | Paper |
Two-dimensional pattern matching with rotations
Combinatorial Pattern Matching | 2010-04-06 | Paper |
