SCARPA: scaffolding reads with practical algorithms. 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.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Keith, Jonathan M. (ed.): Bioinformatics. Volume II: structure, function, and applications (2017)
- Dallard, Clément; Weller, Mathias; Chateau, Annie; Giroudeau, Rodolphe: Instance guaranteed ratio on greedy heuristic for genome scaffolding (2016)
- Chateau, A.; Giroudeau, R.: A complexity and approximation framework for the maximization scaffolding problem (2015)
- McConnell, Ross M.; Nussbaum, Yahav: Linear-time recognition of probe interval graphs (2015)
- McConnell, Ross M.; Nussbaum, Yahav: Linear-time recognition of probe interval graphs (2009)