Figbird: A probabilistic method for filling gaps in genome assemblies
Sumit Tarafder, Mazharul IslamiD, Swakkhar ShatabdaiD, Atif Hasan RahmaniD
Abstract
MotivationAdvances in sequencing technologies have led to sequencing of genomes of a multitude of organisms. However, draft genomes of many of these organisms contain a large number of gaps due to repeats in genomes, low sequencing coverage and limitations in sequencing technologies. Although there exist several tools for filling gaps, many of these do not utilize all information relevant to gap filling. ResultsHere, we present a probabilistic method for filling gaps in draft genome assemblies using second generation reads based on a generative model for sequencing that takes into account information on insert sizes and sequencing errors. Our method is based on the expectation-maximization (EM) algorithm unlike the graph based methods adopted in the literature. Experiments on real biological datasets show that this novel approach can fill up large portions of gaps with small number of errors and misassemblies compared to other state of the art gap filling tools. Availability and ImplementationThe method is implemented using C++ in a software named "Filling Gaps by Iterative Read Distribution (Figbird)", which is available at: https://github.com/SumitTarafder/Figbird. Contactatif@cse.buet.ac.bd Supplementary informationSupplementary data are available at Bioinformatics online.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 7
- FWCI
- 0.49
- Field percentile
- top 46%
- Assay
- Research Focus
- Approach
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
- GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads
Chong Chu, Xin Li, Yufeng Wu·BMC GenomicsPeer-reviewed·Jun 1, 2019
- TGS-GapCloser: fast and accurately passing through the Bermuda in large genome using error-prone third-generation long reads
Mengyang Xu, Lidong Guo, … Xin Liu·bioRxiv·Nov 5, 2019
- DENTIST - using long reads for closing assembly gaps at high accuracy
Arne Ludwig, Martin Pippel, … Michael Hiller·GigaSciencePeer-reviewed·Jan 1, 2022
- Assembly of Long Error-Prone Reads Using Repeat Graphs
Mikhail Kolmogorov, Jeffrey Yuan, … Pavel A. Pevzner·Nature BiotechnologyPeer-reviewed·Apr 1, 2019
- Gapless provides combined scaffolding, gap filling and assembly correction with long reads
Stephan Schmeing, Mark D. Robinson·Life Science AlliancePeer-reviewed·May 4, 2023
- DEGAP: Dynamic Elongation of a Genome Assembly Path
Yicheng Huang, Ziyuan Wang, … Jianwei Zhang·Briefings in BioinformaticsPeer-reviewed·Mar 27, 2024