28 citations · 36 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
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…
cs.DS2014★ 3 cited
Compression of high throughput sequencing data with probabilistic de Bruijn graph
Gaëtan Benoit, Claire Lemaitre, Dominique Lavenier +1
Motivation: Data volumes generated by next-generation sequencing technolo- gies is now a major concern, both for storage and transmission. This triggered the need for more efficien…