Bastien Cazaux

According to our database, Bastien Cazaux authored at least 33 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Algorithms and Complexity on Indexing Founder Graphs.

Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen

Algorithmica, June, 2023

dipwmsearch: a Python package for searching di-PWM motifs.

Marie Mille, Julie Ripoll, Bastien Cazaux, Eric Rivals

Bioinform., April, 2023

2022

Toward Optimal Fingerprint Indexing for Large Scale Genomics.

Clément Agret, Bastien Cazaux, Antoine Limasset

Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

2021

Founder reconstruction enables scalable and seamless pangenomic analysis.

Tuukka Norri, Bastien Cazaux, Saska Dönges, Daniel Valenzuela, Veli Mäkinen

Bioinform., 2021

Algorithms and Complexity on Indexing Elastic Founder Graphs.

Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs.

Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Hierarchical Overlap Graph.

Bastien Cazaux, Eric Rivals

Inf. Process. Lett., 2020

Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring.

Bastien Cazaux, Eric Rivals

CoRR, 2020

Finding all maximal perfect haplotype blocks in linear time.

Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye

Algorithms Mol. Biol., 2020

Linear Time Construction of Indexable Founder Block Graphs.

Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu

Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

Efficient Construction of Hierarchical Overlap Graphs.

Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals

Proceedings of the String Processing and Information Retrieval, 2020

2019

Linking indexing data structures to de Bruijn graphs: Construction and update.

Bastien Cazaux, Thierry Lecroq, Eric Rivals

J. Comput. Syst. Sci., 2019

AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees.

Bastien Cazaux, Guillaume Castel, Eric Rivals

Bioinform., 2019

Linear time minimum segmentation enables scalable founder reconstruction.

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

Algorithms Mol. Biol., 2019

Linear Time Maximum Segmentation Problems in Column Stream Model.

Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri

Proceedings of the String Processing and Information Retrieval, 2019

Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding.

Bastien Cazaux, Eric Rivals

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Relationship between superstring and compression measures: New insights on the greedy conjecture.

Bastien Cazaux, Eric Rivals

Discret. Appl. Math., 2018

Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding.

Bastien Cazaux, Eric Rivals

CoRR, 2018

Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time.

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

CoRR, 2018

Practical lower and upper bounds for the Shortest Linear Superstring.

Bastien Cazaux, Samuel Juhel, Eric Rivals

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time.

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Superstrings with multiplicities.

Bastien Cazaux, Eric Rivals

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

The Compressed Overlap Index.

Rodrigo Cánovas, Bastien Cazaux, Eric Rivals

CoRR, 2017

2016

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

Bastien Cazaux

PhD thesis, 2016

A linear time algorithm for Shortest Cyclic Cover of Strings.

Bastien Cazaux, Eric Rivals

J. Discrete Algorithms, 2016

The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings.

Bastien Cazaux, Eric Rivals

Discret. Appl. Math., 2016

Read mapping on de Bruijn graphs.

Antoine Limasset, Bastien Cazaux, Eric Rivals, Pierre Peterlongo

BMC Bioinform., 2016

Shortest DNA Cyclic Cover in Compressed Space.

Bastien Cazaux, Rodrigo Cánovas, Eric Rivals

Proceedings of the 2016 Data Compression Conference, 2016

Superstring Graph: A New Approach for Genome Assembly.

Bastien Cazaux, Gustavo Sacomoto, Eric Rivals

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree.

Bastien Cazaux, Thierry Lecroq, Eric Rivals

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Reverse engineering of compact suffix trees and links: A novel algorithm.

Bastien Cazaux, Eric Rivals

J. Discrete Algorithms, 2014

Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings.

Bastien Cazaux, Eric Rivals

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

From Indexing Data Structures to de Bruijn Graphs.

Bastien Cazaux, Thierry Lecroq, Eric Rivals

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014