Binary search and set operations on compacted k-mer lists
Yoann Dufresne, Francesco Andreace
The paper introduces a method to perform set operations on k-mers using compacted representations, achieving efficient memory usage and high throughput.
Author
Institut PasteurORCID 0009-0008-0566-200XUnclaimed ORCID profile · follow to get notified of new preprints
5 papers
Recent·Most cited
Yoann Dufresne, Francesco Andreace
The paper introduces a method to perform set operations on k-mers using compacted representations, achieving efficient memory usage and high throughput.
Xian H. Chang, Adam M. Novak, Jordan M. Eizenga…·Benedict Paten
The paper updates Giraffe to map both long and short reads to large pangenome graphs, showing improved speed and accuracy compared to existing tools.
Victor Levallois, Francesco Andreace, Bertrand Le Gal…·Pierre Peterlongo
The paper introduces the Backpack Quotient Filter (BQF), a data structure for querying k-mer abundance with improved space efficiency compared to the Counting Quotient Filter.
Anthony Baire, Pierre Marijon, Francesco Andreace, Pierre Peterlongo
The paper introduces a tool called back_to_sequences that efficiently finds sequences containing specific k-mers from large datasets.
Francesco Andreace, Pierre Lechat, Yoann Dufresne, Rayan Chikhi
This work constructs the largest human pangenome graphs by integrating 52 haplotypes and two synthetic references, comparing five tools to evaluate their representation of genetic variation.