BMC BioinformaticsBioinformaticsPeer-reviewed journal article
Prior knowledge on context-driven DNA fragmentation probabilities can improve de novo genome assembly algorithms
Abstract
BackgroundDe novo genome assembly poses challenges when dealing with highly degraded DNA samples or ultrashort sequencing reads. Probabilistic approaches have been offered to enhance the algorithms, though existing methods rely solely on expected k-meric frequencies in the assemblies, neglecting the broader sequence context that strongly influences DNA fragmentation patterns. ResultsHere, we present a proof of concept showing that prior knowledge on sequence context-driven DNA breakage propensities, through the dedicated parameterisation of k-mer assigned breakage probabilities, can be utilised to recover DNA assemblies that originate from fragmentation patterns more likely to have happened. Our approach is beneficial even for read lengths below the common[~] 25 bps threshold of modern de novo genome assembly algorithms, and well below the threshold used for ultrashort fragments used in ancient DNA research. ConclusionsThis work could lay the groundwork for future enhanced de novo genome assembly algorithms, with improved ability to effectively assemble and evaluate ultrashort DNA fragments relevant for cell-free, ancient, and forensic DNA research.
- assay: whole-genome sequencing
- research focus: genome assembly
- research focus: variant calling
- approach: statistical model
- Citations
- 0
- FWCI
- 0.00
- Field percentile
- 18th percentile
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Robust retrieval of data stored in DNA by de Bruijn graph-based de novo strand assembly
Lifu Song, Feng Geng, … Ying‐Jin Yuan·bioRxiv·Dec 20, 2020
- BOA: A Partitioned View of Genome Assembly
Priyanka Ghosh, Xiaojing An, … Ananth Kalyanaraman·bioRxiv·May 22, 2022
- Genome assembly with variable order de Bruijn graphs
Diego Diaz-Domínguez, Pierfrancesco Martinello, … Leena Salmela·bioRxiv·Sep 6, 2022
- CarpeDeam: A De Novo Metagenome Assembler for Heavily Damaged Ancient Datasets
Louis Kraft, Johannes Söding, … Gabriel Renaud·bioRxiv·Aug 9, 2024
- Effective Machine-Learning Assembly For Next-Generation Sequencing With Very Low Coverage
Louis Ranjard, Thomas K. F. Wong, Allen G. Rodrigo·BMC BioinformaticsPeer-reviewed·Dec 1, 2019
- When Less is More: "Slicing" Sequencing Data Improves Read Decoding Accuracy and De Novo Assembly Quality
Stefano Lonardi, Hamid Mirebrahim, … Timothy J Close·bioRxiv·Jan 3, 2015