Abstract
Motivation: Scaffolding is the process of ordering and orienting contigs produced during genome assembly. Accurate scaffolding is essential for finishing draft assemblies, as it facilitates the costly and laborious procedures needed to fill in the gaps between contigs. Conventional formulations of the scaffolding problem are intractable, and most scaffolding programs rely on heuristic or approximate solutions, with potentially exponential running time.Results: We present SCARPA, a novel scaffolder, which combines fixed-parameter tractable and bounded algorithms with Linear Programming to produce near-optimal scaffolds. We test SCARPA on real datasets in addition to a simulated diploid genome and compare its performance with several state-of-the-art scaffolders. We show that SCARPA produces longer or similar length scaffolds that are highly accurate compared with other scaffolders. SCARPA is also capable of detecting misassembled contigs and reports them during scaffolding.Availability: SCARPA is open source and available from http://compbio.cs.toronto.edu/scarpa. © 2013 The Author.
Cite
CITATION STYLE
Donmez, N., & Brudno, M. (2013). SCARPA: Scaffolding reads with practical algorithms. Bioinformatics, 29(4), 428–434. https://doi.org/10.1093/bioinformatics/bts716
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.