Cargando…
Scalable Genome Assembly through Parallel de Bruijn Graph Construction for Multiple k-mers
Remarkable advancements in high-throughput gene sequencing technologies have led to an exponential growth in the number of sequenced genomes. However, unavailability of highly parallel and scalable de novo assembly algorithms have hindered biologists attempting to swiftly assemble high-quality compl...
Autores principales: | Mahadik, Kanak, Wright, Christopher, Kulkarni, Milind, Bagchi, Saurabh, Chaterji, Somali |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6795807/ https://www.ncbi.nlm.nih.gov/pubmed/31619717 http://dx.doi.org/10.1038/s41598-019-51284-9 |
Ejemplares similares
-
Compact representation of k-mer de Bruijn graphs for genome read assembly
por: Rødland, Einar Andreas
Publicado: (2013) -
Simplitigs as an efficient and scalable representation of de Bruijn graphs
por: Břinda, Karel, et al.
Publicado: (2021) -
Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs
por: Holley, Guillaume, et al.
Publicado: (2020) -
Parallelized short read assembly of large genomes using de Bruijn graphs
por: Liu, Yongchao, et al.
Publicado: (2011) -
Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2
por: Khan, Jamshed, et al.
Publicado: (2022)