Results 91 to 100 of about 2,351 (162)

Reconstruction of DNA Sequences Through Eulerian Traversal of De Bruijn Graphs

Mathematics
Reconstructing a genome from collections of short DNA fragments is a fundamental problem in modern sequencing. Although genome assembly algorithms are widely used in practice, the mathematical conditions that allow exact reconstruction are not always ...
Baining Zhu, Siqi Liu, Suwei Liu
doaj   +1 more source

MICADo - Looking for mutations in targeted PacBio cancer data: an alignment-free method

Frontiers in Genetics, 2016
Targeted sequencing is commonly used in clinical application of NGS technology since it enables generation of sufficient sequencing depth in the targeted genes of interest and thus ensures the best possible downstream analysis.
Justine Rudewicz, Hayssam Soueidan, Raluca Uricaru, Hervé Bonnefoi, Richard Iggo, Jonas Bergh, Macha Nikolski   +6 more
doaj   +1 more source

Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT. [PDF]

Genome Res, 2023
Cracco A, Tomescu AI.
europepmc   +1 more source

Publication Only

HemaSphere, Volume 10, Issue S1, June 2026.
wiley   +1 more source

ploidyfrost: Reference-free estimation of ploidy level from whole genome sequencing data based on de Bruijn graphs. [PDF]

Mol Ecol Resour, 2023
Sun M, Pang E, Bai WN, Zhang DY, Lin K.
europepmc   +1 more source

A Novel Discrete Time Series Representation With De Bruijn Graphs for Enhanced Forecasting Using TimesNet

IEEE Access
In this paper, we present a novel method for advancing time series forecasting by representing discretized time series data through de Bruijn Graphs (dBGs).
Mert Onur Cakiroglu, Hasan Kurban, Elham Buxton, Mehmet Dalkilic   +3 more
doaj   +1 more source

Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants

Algorithms for Molecular Biology
The graph traversal edit distance (GTED), introduced by Ebrahimpour Boroojeny et al. (2018), is an elegant distance measure defined as the minimum edit distance between strings reconstructed from Eulerian trails in two edge-labeled graphs.
Yutong Qiu, Yihang Shen, Carl Kingsford
doaj   +1 more source

Metagenome SNP calling via read-colored de Bruijn graphs. [PDF]

Bioinformatics, 2021
Alipanahi B, Muggli MD, Jundi M, Noyes NR, Boucher C.   +4 more
europepmc   +1 more source

Population-scale detection of non-reference sequence variants using colored de Bruijn graphs. [PDF]

Bioinformatics, 2022
Krannich T, White WTJ, Niehus S, Holley G, Halldórsson BV, Kehr B.   +5 more
europepmc   +1 more source

Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer. [PDF]

Cell Syst, 2021
Ekim B, Berger B, Chikhi R.
europepmc   +1 more source