Cargando…
Building large updatable colored de Bruijn graphs via merging
MOTIVATION: There exist several large genomic and metagenomic data collection efforts, including GenomeTrakr and MetaSub, which are routinely updated with new data. To analyze such datasets, memory-efficient methods to construct and store the colored de Bruijn graph were developed. Yet, a problem th...
Autores principales: | Muggli, Martin D, Alipanahi, Bahar, Boucher, Christina |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6612864/ https://www.ncbi.nlm.nih.gov/pubmed/31510647 http://dx.doi.org/10.1093/bioinformatics/btz350 |
Ejemplares similares
-
cloudSPAdes: assembly of synthetic long reads using de Bruijn graphs
por: Tolstoganov, Ivan, et al.
Publicado: (2019) -
Efficient merging of genome profile alignments
por: Hennig, André, et al.
Publicado: (2019) -
TreeMerge: a new method for improving the scalability of species tree estimation methods
por: Molloy, Erin K, et al.
Publicado: (2019) -
ShaKer: RNA SHAPE prediction using graph kernel
por: Mautner, Stefan, et al.
Publicado: (2019) -
Fully-sensitive seed finding in sequence graphs using a hybrid index
por: Ghaffaari, Ali, et al.
Publicado: (2019)