| Read mapping on de Bruijn graphs A Limasset, B Cazaux, E Rivals, P Peterlongo BMC bioinformatics 17, 1-12, 2016 | 99 | 2016 |
| From indexing data structures to de bruijn graphs B Cazaux, T Lecroq, E Rivals Combinatorial Pattern Matching: 25th Annual Symposium, CPM 2014, Moscow …, 2014 | 28 | 2014 |
| Reverse engineering of compact suffix trees and links: A novel algorithm B Cazaux, E Rivals Journal of Discrete Algorithms 28, 9-22, 2014 | 24 | 2014 |
| Linear time construction of indexable founder block graphs V Mäkinen, B Cazaux, M Equi, T Norri, AI Tomescu arXiv preprint arXiv:2005.09342, 2020 | 23 | 2020 |
| A survey of mapping algorithms in the long-reads era K Sahlin, T Baudeau, B Cazaux, C Marchet Genome Biology 24 (1), 133, 2023 | 22 | 2023 |
| Finding all maximal perfect haplotype blocks in linear time J Alanko, H Bannai, B Cazaux, P Peterlongo, J Stoye Algorithms for Molecular Biology 15, 1-7, 2020 | 15 | 2020 |
| Linear time minimum segmentation enables scalable founder reconstruction T Norri, B Cazaux, D Kosolobov, V Mäkinen Algorithms for Molecular Biology 14, 1-15, 2019 | 15 | 2019 |
| 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 | 15 | 2019 |
| Hierarchical overlap graph B Cazaux, E Rivals Information Processing Letters 155, 105862, 2020 | 14 | 2020 |
| A linear time algorithm for Shortest Cyclic Cover of Strings B Cazaux, E Rivals Journal of Discrete Algorithms 37, 56-67, 2016 | 13 | 2016 |
| 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 | 11 | 2016 |
| Shortest DNA cyclic cover in compressed space B Cazaux, R Cánovas, E Rivals 2016 Data Compression Conference (DCC), 536-545, 2016 | 11 | 2016 |
| Founder reconstruction enables scalable and seamless pangenomic analysis T Norri, B Cazaux, S Dönges, D Valenzuela, V Mäkinen Bioinformatics 37 (24), 4611-4619, 2021 | 9 | 2021 |
| Linear time maximum segmentation problems in column stream model B Cazaux, D Kosolobov, V Mäkinen, T Norri International Symposium on String Processing and Information Retrieval, 322-336, 2019 | 8 | 2019 |
| Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding B Cazaux, E Rivals arXiv preprint arXiv:1805.10070, 2018 | 8 | 2018 |
| The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings B Cazaux, E Rivals Discrete Applied Mathematics 212, 48-60, 2016 | 8 | 2016 |
| AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees B Cazaux, G Castel, E Rivals Bioinformatics 35 (17), 3163-3165, 2019 | 7 | 2019 |
| Practical lower and upper bounds for the shortest linear superstring B Cazaux, S Juhel, E Rivals 17th International Symposium on Experimental Algorithms (SEA 2018), 2018 | 7 | 2018 |
| Algorithms and complexity on indexing elastic founder graphs M Equi, T Norri, J Alanko, B Cazaux, AI Tomescu, V Mäkinen 32nd International Symposium on Algorithms and Computation (ISAAC 2021), 2021 | 6 | 2021 |
| 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 | 6 | 2018 |
