MQF and buffered MQF: quotient filters for efficient storage of k-mers with their counts and metadata

MQF and buffered MQF: quotient filters for efficient storage of k-mers with their counts and metadata

Background: Specialized data structures are required for online algorithms to efficiently handle large sequencing datasets. The counting quotient filter (CQF), a compact hashtable, can efficiently store k-mers with a skewed distribution. Result: Here, we present the mixed-counters quotient filter (M...

Full description

Bibliographic Details
Main Authors: Brown, C.T (Author), Mansour, T.A (Author), Shokrof, M. (Author)
Format: Article
Language:English
Published: BioMed Central Ltd 2021
Subjects:
algorithm
Algorithms
Compact hash tables
Data distribution
Data structures
Debruijn graphs
Digital storage
DNA sequence
Efficient data structures
Flexible framework
Hash functions
high throughput sequencing
High-Throughput Nucleotide Sequencing
High-throughput sequencing
Inexact data structures
k-mers
Large dataset
metadata
Metadata
Minimal perfect hashes
NGS
On-line algorithms
Sequence Analysis, DNA
Skewed distribution
software
Software
Space efficiencies
Online Access:View Fulltext in Publisher

Internet

View Fulltext in Publisher

Similar Items