Bastien Cazaux
Bastien Cazaux
Phd Student Lirmm CNRS Montpellier
Email verificata su lirmm.fr - Home page
TitoloCitata daAnno
Read mapping on de Bruijn graphs
A Limasset, B Cazaux, E Rivals, P Peterlongo
BMC bioinformatics 17 (1), 237, 2016
492016
From indexing data structures to de bruijn graphs
B Cazaux, T Lecroq, E Rivals
Symposium on Combinatorial Pattern Matching, 89-99, 2014
212014
Reverse engineering of compact suffix trees and links: A novel algorithm
B Cazaux, E Rivals
Journal of Discrete Algorithms 28, 9-22, 2014
162014
Linking indexing data structures to de Bruijn graphs: Construction and update
B Cazaux, T Lecroq, E Rivals
Journal of Computer and System Sciences 104, 165-183, 2019
82019
A linear time algorithm for Shortest Cyclic Cover of Strings
B Cazaux, E Rivals
Journal of Discrete Algorithms 37, 56-67, 2016
72016
Minimum segmentation for pan-genomic founder reconstruction in linear time
T Norri, B Cazaux, D Kosolobov, V Mäkinen
arXiv preprint arXiv:1805.03574, 2018
62018
Colib’read on galaxy: a tools suite dedicated to biological information extraction from raw NGS reads
Y Le Bras, O Collin, C Monjeaud, V Lacroix, É Rivals, C Lemaitre, V Miele, ...
GigaScience 5 (1), s13742-015-0105-2, 2016
62016
Shortest DNA cyclic cover in compressed space
B Cazaux, R Cánovas, E Rivals
2016 Data Compression Conference (DCC), 536-545, 2016
62016
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings
B Cazaux, E Rivals
Discrete Applied Mathematics 212, 48-60, 2016
52016
Construction of a de Bruijn graph for assembly from a truncated suffix tree
B Cazaux, T Lecroq, E Rivals
International Conference on Language and Automata Theory and Applications …, 2015
42015
Approximation of greedy algorithms for max-atsp, maximal compression, maximal cycle cover, and shortest cyclic cover of strings
B Cazaux, E Rivals
PSC'2014: Prague Stringology Conference, 148-161, 2014
42014
AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees
B Cazaux, G Castel, E Rivals
Bioinformatics 35 (17), 3163-3165, 2019
32019
Practical lower and upper bounds for the shortest linear superstring
B Cazaux, S Juhel, E Rivals
32018
Hierarchical overlap graph
B Cazaux, E Rivals
Information Processing Letters 155, 105862, 2020
22020
Relationship between superstring and compression measures: New insights on the greedy conjecture
B Cazaux, E Rivals
Discrete Applied Mathematics 245, 59-64, 2018
22018
Superstrings with multiplicities
E Rivals, B Cazaux
22018
The Compressed Overlap Index
R Cánovas, B Cazaux, E Rivals
arXiv preprint arXiv:1707.05613, 2017
22017
Superstring Graph: a new approach for genome assembly
B Cazaux, G Sacomoto, E Rivals
International Conference on Algorithmic Applications in Management, 39-52, 2016
22016
Linear time minimum segmentation enables scalable founder reconstruction
T Norri, B Cazaux, D Kosolobov, V Mäkinen
Algorithms for Molecular Biology 14 (1), 12, 2019
12019
3-Shortest Superstring is 2-approximable by a greedy algorithm
B Cazaux, E Rivals
LIRMM, 2014
12014
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20