| Hierarchical Overlap Graph | 0 | 0.34 | 2020 |
| Efficient Construction of Hierarchical Overlap Graphs. | 0 | 0.34 | 2020 |
| Linear Time Construction of Indexable Founder Block Graphs | 0 | 0.34 | 2020 |
| Linking indexing data structures to de Bruijn graphs: Construction and update | 0 | 0.34 | 2019 |
| Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding. | 0 | 0.34 | 2019 |
| AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees. | 0 | 0.34 | 2019 |
| Finding all maximal perfect haplotype blocks in linear time. | 0 | 0.34 | 2019 |
| Relationship between superstring and compression measures: New insights on the greedy conjecture. | 0 | 0.34 | 2018 |
| Superstrings with multiplicities. | 0 | 0.34 | 2018 |
| Practical lower and upper bounds for the Shortest Linear Superstring. | 0 | 0.34 | 2018 |
| Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding. | 0 | 0.34 | 2018 |
| The Compressed Overlap Index. | 0 | 0.34 | 2017 |
| Shortest DNA Cyclic Cover in Compressed Space | 1 | 0.36 | 2016 |
| A linear time algorithm for Shortest Cyclic Cover of Strings. | 1 | 0.37 | 2016 |
| Superstring Graph: A New Approach for Genome Assembly. | 1 | 0.34 | 2016 |
| The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings | 3 | 0.42 | 2016 |
| Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. | 0 | 0.34 | 2015 |
| Reverse engineering of compact suffix trees and links: A novel algorithm. | 1 | 0.36 | 2014 |
| Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings. | 3 | 0.41 | 2014 |
