86 citations · 157 across the 8 of their papers we have counts for
9 papers
ZOR filters: fast and smaller than fuse filters
Antoine Limasset
Probabilistic membership filters support fast approximate membership queries with a controlled false-positive probability and are widely used across storage, analytic…
Vigemers: on the number of -mers sharing the same XOR-based minimizer
Florian Ingels, Antoine Limasset, Camille Marchet +1
In bioinformatics, minimizers have become an inescapable method for handling -mers (words of fixed size ) extracted from DNA or RNA sequencing, whether for sampling, storage,…
Locality-Preserving Minimal Perfect Hashing of k-mers
Giulio Ermanno Pibiri, Yoshihiro Shibuya, Antoine Limasset
Minimal perfect hashing is the problem of mapping a static set of distinct keys into the address space bijectively. It is well-known that bits are…
Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs
Antoine Limasset, Jean-Francois Flot, Pierre Peterlongo
Motivations Short-read accuracy is important for downstream analyses such as genome assembly and hybrid long-read correction. Despite much work on short-read correction, present-da…
A resource-frugal probabilistic dictionary and applications in bioinformatics
Camille Marchet, Lolita Lecompte, Antoine Limasset +2
Indexing massive data sets is extremely expensive for large scale problems. In many fields, huge amounts of data are currently generated, however extracting meaningful information…
Fast and scalable minimal perfect hashing for massive key sets
Antoine Limasset, Guillaume Rizk, Rayan Chikhi +1
Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical l…
A resource-frugal probabilistic dictionary and applications in (meta)genomics
Camille Marchet, Antoine Limasset, Lucie Bittner +1
Genomic and metagenomic fields, generating huge sets of short genomic sequences, brought their own share of high performance problems. To extract relevant pieces of information fro…
Read Mapping on de Bruijn graph
Antoine Limasset, Bastien Cazaux, Eric Rivals +1
Background Next Generation Sequencing (NGS) has dramatically enhanced our ability to sequence genomes, but not to assemble them. In practice, many published genome sequences remain…
On the representation of de Bruijn graphs
Rayan Chikhi, Antoine Limasset, Shaun Jackman +2
The de Bruijn graph plays an important role in bioinformatics, especially in the context of de novo assembly. However, the representation of the de Bruijn graph in memory is a comp…