Cargando…
Efficient counting of k-mers in DNA sequences using a bloom filter
BACKGROUND: Counting k-mers (substrings of length k in DNA sequence data) is an essential component of many methods in bioinformatics, including for genome and transcriptome assembly, for metagenomic sequencing, and for error correction of sequence reads. Although simple in principle, counting k-mer...
Autores principales: | Melsted, Páll, Pritchard, Jonathan K |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3166945/ https://www.ncbi.nlm.nih.gov/pubmed/21831268 http://dx.doi.org/10.1186/1471-2105-12-333 |
Ejemplares similares
-
Improving Bloom Filter Performance on Sequence Data Using k-mer Bloom Filters
por: Pellow, David, et al.
Publicado: (2017) -
MQF and buffered MQF: quotient filters for efficient storage of k-mers with their counts and metadata
por: Shokrof, Moustafa, et al.
Publicado: (2021) -
aKmerBroom: Ancient oral DNA decontamination using Bloom filters on k-mer sets
por: Duitama González, Camila, et al.
Publicado: (2023) -
Classification of DNA sequences using Bloom filters
por: Stranneheim, Henrik, et al.
Publicado: (2010) -
These Are Not the K-mers You Are Looking For: Efficient Online K-mer Counting Using a Probabilistic Data Structure
por: Zhang, Qingpeng, et al.
Publicado: (2014)