Zobrazeno 1 - 10
of 394
pro vyhledávání: '"de Bruijn graphs"'
Autor:
Sarkar Bijan
Publikováno v:
Annals of the West University of Timisoara: Mathematics and Computer Science, Vol 60, Iss 1, Pp 1-24 (2024)
The assembly of billions of short sequencing reads into a contiguous genome is a daunting task. The foundation knowledge of current DNA assembly models is concentrated among a select group, where the solution to the genome assembly challenge lies in
Externí odkaz:
https://doaj.org/article/e519af7ae6ef4c1c9786b3876c49eb17
Publikováno v:
Genome Biology, Vol 24, Iss 1, Pp 1-19 (2023)
Abstract Background As a single reference genome cannot possibly represent all the variation present across human individuals, pangenome graphs have been introduced to incorporate population diversity within a wide range of genomic analyses. Several
Externí odkaz:
https://doaj.org/article/75120c1ff0e047c09e3f59223dc3ef0f
Autor:
Alexandre Souvorov, Richa Agarwala
Publikováno v:
BMC Bioinformatics, Vol 22, Iss 1, Pp 1-22 (2021)
Abstract Background Illumina is the dominant sequencing technology at this time. Short length, short insert size, some systematic biases, and low-level carryover contamination in Illumina reads continue to make assembly of repeated regions a challeng
Externí odkaz:
https://doaj.org/article/d4fc765b390d448e86692a7e07a65688
Publikováno v:
Algorithms for Molecular Biology, Vol 16, Iss 1, Pp 1-14 (2021)
Abstract K-mer based methods have become prevalent in many areas of bioinformatics. In applications such as database search, they often work with large multi-terabyte-sized datasets. Storing such large datasets is a detriment to tool developers, tool
Externí odkaz:
https://doaj.org/article/7126c47cc903415d9ed68f00ae1e8d99
Publikováno v:
Genome Biology, Vol 22, Iss 1, Pp 1-24 (2021)
Abstract de Bruijn graphs play an essential role in bioinformatics, yet they lack a universal scalable representation. Here, we introduce simplitigs as a compact, efficient, and scalable representation, and ProphAsm, a fast algorithm for their comput
Externí odkaz:
https://doaj.org/article/d577f3a473874b568592374e10d3cd10
Autor:
Fiedler, Lisa
Much of our understanding of eukaryotic life has come from studying mitochondrial DNA, giving rise to leading hypotheses in evolution. To enable these studies, efficient algorithms are needed to interpret, analyze, and draw relevant conclusions from
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A91193
https://ul.qucosa.de/api/qucosa%3A91193/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A91193/attachment/ATT-0/
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Keith Dufault‐Thompson, Xiaofang Jiang
Publikováno v:
iMeta, Vol 1, Iss 1, Pp n/a-n/a (2022)
Abstract High‐throughput sequencing has become an increasingly central component of microbiome research. The development of de Bruijn graph‐based methods for assembling high‐throughput sequencing data has been an important part of the broader a
Externí odkaz:
https://doaj.org/article/234fadfd99a84f249340bf69d8ca5fcf
Publikováno v:
BMC Bioinformatics, Vol 21, Iss 1, Pp 1-18 (2020)
Abstract Background De Bruijn graphs are key data structures for the analysis of next-generation sequencing data. They efficiently represent the overlap between reads and hence, also the underlying genome sequence. However, sequencing errors and repe
Externí odkaz:
https://doaj.org/article/e161feb46e364215bd1f977e499798f7
Autor:
Roland Wittler
Publikováno v:
Algorithms for Molecular Biology, Vol 15, Iss 1, Pp 1-12 (2020)
Abstract Background The increasing amount of available genome sequence data enables large-scale comparative studies. A common task is the inference of phylogenies—a challenging task if close reference sequences are not available, genome sequences a
Externí odkaz:
https://doaj.org/article/4a54f2bf46dd42dcae01d3e229a0aba6