SCARPA: scaffolding reads with practical algorithms.
other · Level V
Where this comes from
- Record sourced from PubMed, PMID 23274213.
- Also identified by DOI 10.1093/bioinformatics/bts716.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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. 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. SCARPA is open source and available from http://compbio.cs.toronto.edu/scarpa.
Medical subject headings
- Algorithms
- Contig Mapping
- High-Throughput Nucleotide Sequencing