| Publication | Date of Publication | Type |
|---|
| Counting overlapping pairs of words | 2026-01-28 | Paper |
| Sets of period sets for words of length n. | 2024-11-20 | Dataset |
| Convergence of the number of period sets in strings | 2024-11-14 | Paper |
scientific article; zbMATH DE number 7696008 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-14 | Paper |
Efficient Construction of Hierarchical Overlap Graphs
1511.68104 | 2022-12-22 | Paper |
scientific article; zbMATH DE number 7559192 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Superstrings with multiplicities | 2020-12-16 | Paper |
| Practical lower and upper bounds for the shortest linear superstring | 2020-12-16 | Paper |
Hierarchical overlap graph
Information Processing Letters | 2019-12-19 | Paper |
Linking indexing data structures to de Bruijn graphs: construction and update
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Relationship between superstring and compression measures: new insights on the greedy conjecture
Discrete Applied Mathematics | 2018-05-24 | Paper |
Superstring graph: a new approach for genome assembly
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
Discrete Applied Mathematics | 2016-09-12 | Paper |
A linear time algorithm for shortest cyclic cover of strings
Journal of Discrete Algorithms | 2016-07-15 | Paper |
Construction of a de Bruijn graph for assembly from a truncated suffix tree
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Reverse engineering of compact suffix trees and links: a novel algorithm
Journal of Discrete Algorithms | 2014-09-05 | Paper |
From indexing data structures to de Bruijn graphs
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Complexities of the centre and median string problems
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Hardness of optimal spaced seed design
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Tiling an Interval of the Discrete Line
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Longest common subsequence problem for unoriented and cyclic strings
Theoretical Computer Science | 2007-02-26 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Hardness results for the center and median string problems under the weighted and unweighted edit distances
Journal of Discrete Algorithms | 2005-10-27 | Paper |
A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
Combinatorics of periods in strings.
Journal of Combinatorial Theory. Series A | 2004-01-06 | Paper |
On the Distribution of the Number of Missing Words in Random Texts
Combinatorics, Probability and Computing | 2003-03-24 | Paper |
| scientific article; zbMATH DE number 1754624 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1615294 (Why is no real title available?) | 2001-07-08 | Paper |
Optimal representation in average using Kolmogorov complexity
Theoretical Computer Science | 1999-01-20 | Paper |
