From Indexing Data Structures to de Bruijn Graphs. - Bastien Cazaux; Thierry Lecroq; Eric Rivals (CPM, 2014)

Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings. - Bastien Cazaux; Eric Rivals (Stringology, 2014)

Reverse engineering of compact suffix trees and links: A novel algorithm. - Bastien Cazaux; Eric Rivals (J. Discrete Algorithms, 2014)

Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. - Bastien Cazaux; Thierry Lecroq; Eric Rivals (LATA, 2015)

Superstring Graph: A New Approach for Genome Assembly. - Bastien Cazaux; Gustavo Sacomoto; Eric Rivals (AAIM, 2016)

Shortest DNA Cyclic Cover in Compressed Space. - Bastien Cazaux; Rodrigo Cánovas; Eric Rivals (DCC, 2016)

Read mapping on de Bruijn graphs. - Antoine Limasset; Bastien Cazaux; Eric Rivals; Pierre Peterlongo (BMC Bioinform., 2016)

The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings. - Bastien Cazaux; Eric Rivals (Discret. Appl. Math., 2016)

A linear time algorithm for Shortest Cyclic Cover of Strings. - Bastien Cazaux; Eric Rivals (J. Discrete Algorithms, 2016)

Approximation de superchaîne, indexation et assemblage de génome. (Approximation of superstring, indexation and genome assembly). - Bastien Cazaux (2016)

The Compressed Overlap Index. - Rodrigo Cánovas; Bastien Cazaux; Eric Rivals (CoRR, 2017)

Superstrings with multiplicities. - Bastien Cazaux; Eric Rivals (CPM, 2018)

Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time. - Tuukka Norri; Bastien Cazaux; Dmitry Kosolobov; Veli Mäkinen (WABI, 2018)

Practical lower and upper bounds for the Shortest Linear Superstring. - Bastien Cazaux; Samuel Juhel; Eric Rivals (SEA, 2018)

Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time. - Tuukka Norri; Bastien Cazaux; Dmitry Kosolobov; Veli Mäkinen (CoRR, 2018)

Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding. - Bastien Cazaux; Eric Rivals (CoRR, 2018)

Relationship between superstring and compression measures: New insights on the greedy conjecture. - Bastien Cazaux; Eric Rivals (Discret. Appl. Math., 2018)

Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding. - Bastien Cazaux; Eric Rivals (CPM, 2019)

Linear Time Maximum Segmentation Problems in Column Stream Model. - Bastien Cazaux; Dmitry Kosolobov; Veli Mäkinen; Tuukka Norri (SPIRE, 2019)

Linear time minimum segmentation enables scalable founder reconstruction. - Tuukka Norri; Bastien Cazaux; Dmitry Kosolobov; Veli Mäkinen (Algorithms Mol. Biol., 2019)

AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees. - Bastien Cazaux; Guillaume Castel; Eric Rivals (Bioinform., 2019)

Linking indexing data structures to de Bruijn graphs: Construction and update. - Bastien Cazaux; Thierry Lecroq; Eric Rivals (J. Comput. Syst. Sci., 2019)

Efficient Construction of Hierarchical Overlap Graphs. - Sung Gwan Park; Bastien Cazaux; Kunsoo Park; Eric Rivals (SPIRE, 2020)

Linear Time Construction of Indexable Founder Block Graphs. - Veli Mäkinen; Bastien Cazaux; Massimo Equi; Tuukka Norri; Alexandru I. Tomescu (WABI, 2020)

Finding all maximal perfect haplotype blocks in linear time. - Jarno Alanko; Hideo Bannai; Bastien Cazaux; Pierre Peterlongo; Jens Stoye (Algorithms Mol. Biol., 2020)

Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring. - Bastien Cazaux; Eric Rivals (CoRR, 2020)

Hierarchical Overlap Graph. - Bastien Cazaux; Eric Rivals (Inf. Process. Lett., 2020)

A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. - Sangsoo Park; Sung Gwan Park; Bastien Cazaux; Kunsoo Park; Eric Rivals (CPM, 2021)

Algorithms and Complexity on Indexing Elastic Founder Graphs. - Massimo Equi; Tuukka Norri; Jarno Alanko; Bastien Cazaux; Alexandru I. Tomescu; Veli Mäkinen (ISAAC, 2021)

Founder reconstruction enables scalable and seamless pangenomic analysis. - Tuukka Norri; Bastien Cazaux; Saska Dönges; Daniel Valenzuela 001; Veli Mäkinen (Bioinform., 2021)

Toward Optimal Fingerprint Indexing for Large Scale Genomics. - Clément Agret; Bastien Cazaux; Antoine Limasset (WABI, 2022)

dipwmsearch: a Python package for searching di-PWM motifs. - Marie Mille; Julie Ripoll; Bastien Cazaux; Eric Rivals (Bioinform., 2023)

Algorithms and Complexity on Indexing Founder Graphs. - Massimo Equi; Tuukka Norri; Jarno Alanko; Bastien Cazaux; Alexandru I. Tomescu; Veli Mäkinen (Algorithmica, 2023)

Conway-Bromage-Lyndon (CBL): an exact, dynamic representation of k-mer sets. - Igor Martayan; Bastien Cazaux; Antoine Limasset; Camille Marchet (Bioinform., 2024)

Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform. - Florian Ingels; Anaïs Denis; Bastien Cazaux (CoRR, 2025)