Cargando…
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time
A fundamental operation in computational genomics is to reduce the input sequences to their constituent k-mers. For maximum performance of downstream applications it is important to store the k-mers in small space, while keeping the representation easy and efficient to use (i.e. without k-mer repeti...
Autores principales: | Schmidt, Sebastian, Alanko, Jarno N. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10318842/ https://www.ncbi.nlm.nih.gov/pubmed/37403080 http://dx.doi.org/10.1186/s13015-023-00227-1 |
Ejemplares similares
-
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time
por: Schmidt, Sebastian, et al.
Publicado: (2023) -
Matchtigs: minimum plain text representation of k-mer sets
por: Schmidt, Sebastian, et al.
Publicado: (2023) -
The K-mer File Format: a standardized and compact disk representation of sets of k-mers
por: Dufresne, Yoann, et al.
Publicado: (2022) -
Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes
por: Alanko, Jarno N, et al.
Publicado: (2023) -
Space-efficient representation of genomic k-mer count tables
por: Shibuya, Yoshihiro, et al.
Publicado: (2022)