Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Antoine Limasset

Showing results (1-10 of 18) with videos related to

Pageof 2
Sort By:
Bioinformatics (Oxford, England)|June 30, 2023
Scalable sequence database search using partitioned aggregated Bloom comb treesCamille Marchet, Antoine Limasset
Bioinformatics (Oxford, England)|April 6, 2021
BLight: efficient exact associative structure for k-mersCamille Marchet, Mael Kerbiriou, Antoine Limasset
Bioinformatics (Oxford, England)|June 17, 2016
Compacting de Bruijn graphs from sequencing data quickly and in low memoryRayan Chikhi, Antoine Limasset, Paul Medvedev
Bioinformatics Advances|July 15, 2025
K2R: Tinted de Bruijn graphs implementation for efficient read extraction from sequencing datasetsLéa Vandamme, Bastien Cazaux, Antoine Limasset
Peerj|April 6, 2026
Automated evaluation of multiple sequence alignment methods to handle third generation sequencing errorsCoralie Rohmer, Hélène Touzet, Antoine Limasset
Bioinformatics (Oxford, England)|December 7, 2019
Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphsAntoine Limasset, Jean-François Flot, Pierre Peterlongo
Bioinformatics (Oxford, England)|February 21, 2019
Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphsAntoine Limasset, Jean-François Flot, Pierre Peterlongo
Bioinformatics (Oxford, England)|June 30, 2023
Locality-preserving minimal perfect hashing of k-mersGiulio Ermanno Pibiri, Yoshihiro Shibuya, Antoine Limasset
Bioinformatics Advances|June 25, 2025
OReO: optimizing read order for practical compressionMathilde Girard, Léa Vandamme, Bastien Cazaux, et al.
BMC Bioinformatics|June 17, 2016
Read mapping on de Bruijn graphsAntoine Limasset, Bastien Cazaux, Eric Rivals, et al.
Pageof 2

Showing results (1-10 of 18) with videos related to

Sort By:
Pageof 2
Bioinformatics (Oxford, England)|June 30, 2023
Scalable sequence database search using partitioned aggregated Bloom comb treesCamille Marchet, Antoine Limasset
Bioinformatics (Oxford, England)|April 6, 2021
BLight: efficient exact associative structure for k-mersCamille Marchet, Mael Kerbiriou, Antoine Limasset
Bioinformatics (Oxford, England)|June 17, 2016
Compacting de Bruijn graphs from sequencing data quickly and in low memoryRayan Chikhi, Antoine Limasset, Paul Medvedev
Bioinformatics Advances|July 15, 2025
K2R: Tinted de Bruijn graphs implementation for efficient read extraction from sequencing datasetsLéa Vandamme, Bastien Cazaux, Antoine Limasset
Peerj|April 6, 2026
Automated evaluation of multiple sequence alignment methods to handle third generation sequencing errorsCoralie Rohmer, Hélène Touzet, Antoine Limasset
Bioinformatics (Oxford, England)|December 7, 2019
Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphsAntoine Limasset, Jean-François Flot, Pierre Peterlongo
Bioinformatics (Oxford, England)|February 21, 2019
Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphsAntoine Limasset, Jean-François Flot, Pierre Peterlongo
Bioinformatics (Oxford, England)|June 30, 2023
Locality-preserving minimal perfect hashing of k-mersGiulio Ermanno Pibiri, Yoshihiro Shibuya, Antoine Limasset
Bioinformatics Advances|June 25, 2025
OReO: optimizing read order for practical compressionMathilde Girard, Léa Vandamme, Bastien Cazaux, et al.
BMC Bioinformatics|June 17, 2016
Read mapping on de Bruijn graphsAntoine Limasset, Bastien Cazaux, Eric Rivals, et al.
Pageof 2