Cargando…
Disk-based k-mer counting on a PC
BACKGROUND: The k-mer counting problem, which is to build the histogram of occurrences of every k-symbol long substring in a given text, is important for many bioinformatics applications. They include developing de Bruijn graph genome assemblers, fast multiple sequence alignment and repeat detection...
Autores principales: | Deorowicz, Sebastian, Debudaj-Grabysz, Agnieszka, Grabowski, Szymon |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3680041/ https://www.ncbi.nlm.nih.gov/pubmed/23679007 http://dx.doi.org/10.1186/1471-2105-14-160 |
Ejemplares similares
-
FAMSA: Fast and accurate multiple sequence alignment of huge protein families
por: Deorowicz, Sebastian, et al.
Publicado: (2016) -
Indexing Arbitrary-Length k-Mers in Sequencing Reads
por: Kowalski, Tomasz, et al.
Publicado: (2015) -
Indexes of Large Genome Collections on a PC
por: Danek, Agnieszka, et al.
Publicado: (2014) -
Correction: Indexes of Large Genome Collections on a PC
por: Danek, Agnieszka, et al.
Publicado: (2015) -
The K-mer File Format: a standardized and compact disk representation of sets of k-mers
por: Dufresne, Yoann, et al.
Publicado: (2022)