Bastien Cazaux

ORCID

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 33

Top Venues

University of Montpellier, France (PHD)

Education History

University of Montpellier, France

PHD

Publications

Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
Algorithms and Complexity on Indexing Founder Graphs. Algorithmica 85 (6) (2023)
Clément Agret, Bastien Cazaux, Antoine Limasset
Toward Optimal Fingerprint Indexing for Large Scale Genomics. WABI (2022)
Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
Algorithms and Complexity on Indexing Founder Graphs. CoRR (2021)
Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. CPM (2021)
Tuukka Norri, Bastien Cazaux, Saska Dönges, Daniel Valenzuela, Veli Mäkinen
Founder reconstruction enables scalable and seamless pangenomic analysis. Bioinform. 37 (24) (2021)
Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
Algorithms and Complexity on Indexing Elastic Founder Graphs. ISAAC (2021)
Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. CoRR (2021)
Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu
Linear Time Construction of Indexable Founder Block Graphs. WABI (2020)
Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals
Efficient Construction of Hierarchical Overlap Graphs. SPIRE (2020)
Bastien Cazaux, Eric Rivals
Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring. CoRR (2020)
Bastien Cazaux, Eric Rivals
Hierarchical Overlap Graph. Inf. Process. Lett. 155 (2020)
Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu
Linear Time Construction of Indexable Founder Block Graphs. CoRR (2020)
Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye
Finding all maximal perfect haplotype blocks in linear time. Algorithms Mol. Biol. 15 (1) (2020)
Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye
Finding All Maximal Perfect Haplotype Blocks in Linear Time. WABI (2019)
Bastien Cazaux, Eric Rivals
Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding. CPM (2019)
Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen
Linear time minimum segmentation enables scalable founder reconstruction. Algorithms Mol. Biol. 14 (1) (2019)
Bastien Cazaux, Thierry Lecroq, Eric Rivals
Linking indexing data structures to de Bruijn graphs: Construction and update. J. Comput. Syst. Sci. 104 (2019)
Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri
Linear Time Maximum Segmentation Problems in Column Stream Model. SPIRE (2019)
Bastien Cazaux, Guillaume Castel, Eric Rivals
AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees. Bioinform. 35 (17) (2019)
Bastien Cazaux, Eric Rivals
Relationship between superstring and compression measures: New insights on the greedy conjecture. Discret. Appl. Math. 245 (2018)
Bastien Cazaux, Samuel Juhel, Eric Rivals
Practical lower and upper bounds for the Shortest Linear Superstring. SEA (2018)
Bastien Cazaux, Eric Rivals
Hierarchical Overlap Graph. CoRR (2018)
Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen
Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time. CoRR (2018)
Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen
Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time. WABI (2018)
Bastien Cazaux, Eric Rivals
Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding. CoRR (2018)
Bastien Cazaux, Eric Rivals
Superstrings with multiplicities. CPM (2018)
Rodrigo Cánovas, Bastien Cazaux, Eric Rivals
The Compressed Overlap Index. CoRR (2017)
Bastien Cazaux, Eric Rivals
A linear time algorithm for Shortest Cyclic Cover of Strings. J. Discrete Algorithms 37 (2016)
Bastien Cazaux, Eric Rivals
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings. Discret. Appl. Math. 212 (2016)
Bastien Cazaux, Rodrigo Cánovas, Eric Rivals
Shortest DNA Cyclic Cover in Compressed Space. DCC (2016)
Bastien Cazaux, Gustavo Sacomoto, Eric Rivals
Superstring Graph: A New Approach for Genome Assembly. AAIM (2016)
Antoine Limasset, Bastien Cazaux, Eric Rivals, Pierre Peterlongo
Read mapping on de Bruijn graphs. BMC Bioinform. 17 (2016)
Bastien Cazaux, Thierry Lecroq, Eric Rivals
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. LATA (2015)
Bastien Cazaux, Eric Rivals
Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings. Stringology (2014)
Bastien Cazaux, Eric Rivals
Reverse engineering of compact suffix trees and links: A novel algorithm. J. Discrete Algorithms 28 (2014)
Bastien Cazaux, Thierry Lecroq, Eric Rivals
From Indexing Data Structures to de Bruijn Graphs. CPM (2014)

Bastien Cazaux.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bastien Cazaux