Cargando…

Robust data storage in DNA by de Bruijn graph-based de novo strand assembly

DNA data storage is a rapidly developing technology with great potential due to its high density, long-term durability, and low maintenance cost. The major technical challenges include various errors, such as strand breaks, rearrangements, and indels that frequently arise during DNA synthesis, ampli...

Descripción completa

Detalles Bibliográficos
Autores principales:	Song, Lifu, Geng, Feng, Gong, Zi-Yi, Chen, Xin, Tang, Jijun, Gong, Chunye, Zhou, Libang, Xia, Rui, Han, Ming-Zhe, Xu, Jing-Yi, Li, Bing-Zhi, Yuan, Ying-Jin
Formato:	Online Artículo Texto
Lenguaje:	English
Publicado:	Nature Publishing Group UK 2022
Materias:	Article
Acceso en línea:	https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9468002/ https://www.ncbi.nlm.nih.gov/pubmed/36097016 http://dx.doi.org/10.1038/s41467-022-33046-w

Ejemplares similares

De novo assembly and genotyping of variants using colored de Bruijn graphs
por: Iqbal, Zamin, et al.
Publicado: (2012)

IDBA-tran: a more robust de novo de Bruijn graph assembler for transcriptomes with uneven expression levels
por: Peng, Yu, et al.
Publicado: (2013)

Why are de Bruijn graphs useful for genome assembly?
por: Compeau, Phillip E. C., et al.
Publicado: (2011)

Evaluating de Bruijn Graph Assemblers on 454 Transcriptomic Data
por: Ren, Xianwen, et al.
Publicado: (2012)

Utilizing de Bruijn graph of metagenome assembly for metatranscriptome analysis
por: Ye, Yuzhen, et al.
Publicado: (2016)

Read mapping on de Bruijn graphs
por: Limasset, Antoine, et al.
Publicado: (2016)

DBTRG: De Bruijn Trim rotation graph encoding for reliable DNA storage()
por: Zhao, Yunzhu, et al.
Publicado: (2023)

Lossless indexing with counting de Bruijn graphs
por: Karasikov, Mikhail, et al.
Publicado: (2022)

What is the difference between the breakpoint graph and the de Bruijn graph?
por: Lin, Yu, et al.
Publicado: (2014)

Parallelized short read assembly of large genomes using de Bruijn graphs
por: Liu, Yongchao, et al.
Publicado: (2011)

Compact representation of k-mer de Bruijn graphs for genome read assembly
por: Rødland, Einar Andreas
Publicado: (2013)

HaVec: An Efficient de Bruijn Graph Construction Algorithm for Genome Assembly
por: Rahman, Md Mahfuzer, et al.
Publicado: (2017)

cloudSPAdes: assembly of synthetic long reads using de Bruijn graphs
por: Tolstoganov, Ivan, et al.
Publicado: (2019)

Fast and efficient Rmap assembly using the Bi-labelled de Bruijn graph
por: Mukherjee, Kingshuk, et al.
Publicado: (2021)

Simplitigs as an efficient and scalable representation of de Bruijn graphs
por: Břinda, Karel, et al.
Publicado: (2021)

A memory-efficient algorithm to obtain splicing graphs and de novo expression estimates from de Bruijn graphs of RNA-Seq data
por: Sze, Sing-Hoi, et al.
Publicado: (2014)

GRIDSS: sensitive and specific genomic rearrangement detection using positional de Bruijn graph assembly
por: Cameron, Daniel L., et al.
Publicado: (2017)

Scalable Genome Assembly through Parallel de Bruijn Graph Construction for Multiple k-mers
por: Mahadik, Kanak, et al.
Publicado: (2019)

Integrating long-range connectivity information into de Bruijn graphs
por: Turner, Isaac, et al.
Publicado: (2018)

Alignment- and reference-free phylogenomics with colored de Bruijn graphs
por: Wittler, Roland
Publicado: (2020)

Buffering updates enables efficient dynamic de Bruijn graphs
por: Alanko, Jarno, et al.
Publicado: (2021)

MBG: Minimizer-based sparse de Bruijn Graph construction
por: Rautiainen, Mikko, et al.
Publicado: (2021)

deBGR: an efficient and near-exact representation of the weighted de Bruijn graph
por: Pandey, Prashant, et al.
Publicado: (2017)

Building large updatable colored de Bruijn graphs via merging
por: Muggli, Martin D, et al.
Publicado: (2019)

Pan-genome de Bruijn graph using the bidirectional FM-index
por: Depuydt, Lore, et al.
Publicado: (2023)

MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs
por: Li, Dinghua, et al.
Publicado: (2017)

A space and time-efficient index for the compacted colored de Bruijn graph
por: Almodaresi, Fatemeh, et al.
Publicado: (2018)

BrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs
por: Heydari, Mahdi, et al.
Publicado: (2018)

Accurate self-correction of errors in long reads using de Bruijn graphs
por: Salmela, Leena, et al.
Publicado: (2017)

Compacting de Bruijn graphs from sequencing data quickly and in low memory
por: Chikhi, Rayan, et al.
Publicado: (2016)

Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs
por: Holley, Guillaume, et al.
Publicado: (2020)

Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
por: Cracco, Andrea, et al.
Publicado: (2023)

Efficient High-Quality Metagenome Assembly from Long Accurate Reads using Minimizer-space de Bruijn Graphs
por: Benoit, Gaëtan, et al.
Publicado: (2023)

Space-efficient and exact de Bruijn graph representation based on a Bloom filter
por: Chikhi, Rayan, et al.
Publicado: (2013)

Genome-wide somatic variant calling using localized colored de Bruijn graphs
por: Narzisi, Giuseppe, et al.
Publicado: (2018)

Detecting circular RNA from high-throughput sequence data with de Bruijn graph
por: Li, Xin, et al.
Publicado: (2020)

deSALT: fast and accurate long transcriptomic read alignment with de Bruijn graph-based index
por: Liu, Bo, et al.
Publicado: (2019)

Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
por: Kundeti, Vamsi K, et al.
Publicado: (2010)

Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph
por: Benoit, Gaëtan, et al.
Publicado: (2015)

A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
por: Beller, Timo, et al.
Publicado: (2016)

Cannot write session to /tmp/vufind_sessions/sess_com29ork5tfspvibfhasvmi7tg