default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBastien Cazaux
Person information
- affiliation: University of Lille, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Massimo Equi, Tuukka Norri
, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Founder Graphs. Algorithmica 85(6): 1586-1623 (2023)- [j12]Marie Mille, Julie Ripoll, Bastien Cazaux, Eric Rivals:
dipwmsearch: a Python package for searching di-PWM motifs. Bioinform. 39(4) (2023) - 2022
- [c16]Clément Agret, Bastien Cazaux, Antoine Limasset:
Toward Optimal Fingerprint Indexing for Large Scale Genomics. WABI 2022: 25:1-25:15 - 2021
- [j11]Tuukka Norri, Bastien Cazaux, Saska Dönges, Daniel Valenzuela, Veli Mäkinen:
Founder reconstruction enables scalable and seamless pangenomic analysis. Bioinform. 37(24): 4611-4619 (2021) - [c15]Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals:
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. CPM 2021: 22:1-22:9 - [c14]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Elastic Founder Graphs. ISAAC 2021: 20:1-20:18 - [i8]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Founder Graphs. CoRR abs/2102.12822 (2021) - [i7]Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals:
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. CoRR abs/2102.12824 (2021) - 2020
- [j10]Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye:
Finding all maximal perfect haplotype blocks in linear time. Algorithms Mol. Biol. 15(1): 2 (2020) - [j9]Bastien Cazaux, Eric Rivals:
Hierarchical Overlap Graph. Inf. Process. Lett. 155 (2020) - [c13]Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals:
Efficient Construction of Hierarchical Overlap Graphs. SPIRE 2020: 277-290 - [c12]Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu:
Linear Time Construction of Indexable Founder Block Graphs. WABI 2020: 7:1-7:18 - [i6]Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu:
Linear Time Construction of Indexable Founder Block Graphs. CoRR abs/2005.09342 (2020) - [i5]Bastien Cazaux, Eric Rivals:
Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring. CoRR abs/2012.08878 (2020)
2010 – 2019
- 2019
- [j8]Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Linear time minimum segmentation enables scalable founder reconstruction. Algorithms Mol. Biol. 14(1): 12:1-12:15 (2019) - [j7]Bastien Cazaux, Guillaume Castel, Eric Rivals:
AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees. Bioinform. 35(17): 3163-3165 (2019) - [j6]Bastien Cazaux, Thierry Lecroq, Eric Rivals:
Linking indexing data structures to de Bruijn graphs: Construction and update. J. Comput. Syst. Sci. 104: 165-183 (2019) - [c11]Bastien Cazaux, Eric Rivals:
Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding. CPM 2019: 24:1-24:20 - [c10]Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri:
Linear Time Maximum Segmentation Problems in Column Stream Model. SPIRE 2019: 322-336 - [c9]Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye:
Finding All Maximal Perfect Haplotype Blocks in Linear Time. WABI 2019: 8:1-8:9 - 2018
- [j5]Bastien Cazaux, Eric Rivals:
Relationship between superstring and compression measures: New insights on the greedy conjecture. Discret. Appl. Math. 245: 59-64 (2018) - [c8]Bastien Cazaux, Eric Rivals:
Superstrings with multiplicities. CPM 2018: 21:1-21:16 - [c7]Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time. WABI 2018: 15:1-15:15 - [c6]Bastien Cazaux, Samuel Juhel, Eric Rivals:
Practical lower and upper bounds for the Shortest Linear Superstring. SEA 2018: 18:1-18:14 - [i4]Bastien Cazaux, Eric Rivals:
Hierarchical Overlap Graph. CoRR abs/1802.04632 (2018) - [i3]Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time. CoRR abs/1805.03574 (2018) - [i2]Bastien Cazaux, Eric Rivals:
Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding. CoRR abs/1805.10070 (2018) - 2017
- [i1]Rodrigo Cánovas, Bastien Cazaux, Eric Rivals:
The Compressed Overlap Index. CoRR abs/1707.05613 (2017) - 2016
- [b1]Bastien Cazaux:
Approximation de superchaîne, indexation et assemblage de génome. (Approximation of superstring, indexation and genome assembly). University of Montpellier, France, 2016 - [j4]Antoine Limasset, Bastien Cazaux, Eric Rivals, Pierre Peterlongo:
Read mapping on de Bruijn graphs. BMC Bioinform. 17: 237 (2016) - [j3]Bastien Cazaux, Eric Rivals:
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings. Discret. Appl. Math. 212: 48-60 (2016) - [j2]Bastien Cazaux, Eric Rivals:
A linear time algorithm for Shortest Cyclic Cover of Strings. J. Discrete Algorithms 37: 56-67 (2016) - [c5]Bastien Cazaux, Gustavo Sacomoto, Eric Rivals:
Superstring Graph: A New Approach for Genome Assembly. AAIM 2016: 39-52 - [c4]Bastien Cazaux, Rodrigo Cánovas, Eric Rivals:
Shortest DNA Cyclic Cover in Compressed Space. DCC 2016: 536-545 - 2015
- [c3]Bastien Cazaux, Thierry Lecroq, Eric Rivals:
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. LATA 2015: 109-120 - 2014
- [j1]Bastien Cazaux, Eric Rivals:
Reverse engineering of compact suffix trees and links: A novel algorithm. J. Discrete Algorithms 28: 9-22 (2014) - [c2]Bastien Cazaux, Thierry Lecroq, Eric Rivals:
From Indexing Data Structures to de Bruijn Graphs. CPM 2014: 89-99 - [c1]Bastien Cazaux, Eric Rivals:
Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings. Stringology 2014: 148-161
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
