Antoine Limasset

Orcid: 0000-0002-0669-4141

According to our database1, Antoine Limasset authored at least 16 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Locality-preserving minimal perfect hashing of <i>k</i>-mers.
Bioinform., 2023

Scalable sequence database search using partitioned aggregated Bloom comb trees.
Bioinform., 2023

Fractional Hitting Sets for Efficient and Lightweight Genomic Data Sketching.
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

2022
Locality-Preserving Minimal Perfect Hashing of k-mers.
CoRR, 2022

Toward Optimal Fingerprint Indexing for Large Scale Genomics.
Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

2021
BLight: efficient exact associative structure for k-mers.
Bioinform., 2021

2020
A resource-frugal probabilistic dictionary and applications in bioinformatics.
Discret. Appl. Math., 2020

Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs.
Bioinform., 2020

2017
Novel approaches for the exploitation of high throughput sequencing data. (Nouvelles approches pour l'exploitation des données de sequençage haut débit).
PhD thesis, 2017

Toward perfect reads.
CoRR, 2017

Fast and Scalable Minimal Perfect Hashing for Massive Key Sets.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016
Read mapping on de Bruijn graphs.
BMC Bioinform., 2016

Compacting de Bruijn graphs from sequencing data quickly and in low memory.
Bioinform., 2016

A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics.
Proceedings of the Prague Stringology Conference 2016, 2016

2015
On the Representation of De Bruijn Graphs.
J. Comput. Biol., 2015

Read Mapping on de Bruijn graph.
CoRR, 2015


  Loading...