Raptor: A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences
Keyword(s):
AbstractWe present Raptor, a tool for approximately searching many queries in large collections of nucleotide sequences. In comparison with similar tools like Mantis and COBS, Raptor is 12-144 times faster and uses up to 30 times less memory. Raptor uses winnowing minimizers to define a set of representative k-mers, an extension of the Interleaved Bloom Filters (IBF) as a set membership data structure, and probabilistic thresholding for minimizers. Our approach allows compression and a partitioning of the IBF to enable the effective use of secondary memory.
Keyword(s):
2012 ◽
Vol 20
(1)
◽
pp. 295-304
◽
2018 ◽
Vol 115
(51)
◽
pp. 13093-13098
◽
Keyword(s):
2015 ◽
Vol 2015
◽
pp. 1-9
◽
Keyword(s):
2021 ◽
Vol 1209
(1)
◽
pp. 012001
Keyword(s):