SOPRA: scaffolding algorithm for paired reads via statistical optimization. Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing applications, de novo assembly of moderate size genomes from such reads remains a significant challenge. These limitations could be partially overcome by utilizing mate pair technology, which provides pairs of short reads separated by a known distance along the genome. Results: We have developed SOPRA, a tool designed to exploit the mate pair/paired-end information for assembly of short reads. The main focus of the algorithm is selecting a sufficiently large subset of simultaneously satisfiable mate pair constraints to achieve a balance between the size and the quality of the output scaffolds. Scaffold assembly is presented as an optimization problem for variables associated with vertices and with edges of the contig connectivity graph. Vertices of this graph are individual contigs with edges drawn between contigs connected by mate pairs. Similar graph problems have been invoked in the context of shotgun sequencing and scaffold building for previous generation of sequencing projects. However, given the error-prone nature of HTS data and the fundamental limitations from the shortness of the reads, the ad hoc greedy algorithms used in the earlier studies are likely to lead to poor quality results in the current context. SOPRA circumvents this problem by treating all the constraints on equal footing for solving the optimization problem, the solution itself indicating the problematic constraints (chimeric/repetitive contigs, etc.) to be removed. The process of solving and removing of constraints is iterated till one reaches a core set of consistent constraints. For SOLiD sequencer data, SOPRA uses a dynamic programming approach to robustly translate the color-space assembly to base-space. For assessing the quality of an assembly, we report the no-match/mismatch error rate as well as the rates of various rearrangement errors. Conclusions: Applying SOPRA to real data from bacterial genomes, we were able to assemble contigs into scaffolds of significant length (N50 up to 200 Kb) with very few errors introduced in the process. In general, the methodology presented here will allow better scaffold assemblies of any type of mate pair sequencing data.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Pan, Weihua; Jiang, Tao; Lonardi, Stefano: OMGS: optical map-based genome scaffolding (2019)
- Weller, Mathias; Chateau, Annie; Dallard, Clément; Giroudeau, Rodolphe: Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (2018)
- Carugo, Oliviero (ed.); Eisenhaber, Frank (ed.): Data mining techniques for the life sciences (2016)
- 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)
- Weller, Mathias; Chateau, Annie; Giroudeau, Rodolphe: On the complexity of scaffolding problems: from cliques to sparse graphs (2015)
- Dayarian, Adel; Michael, Todd P.; Sengupta, Anirvan M.: SOPRA: scaffolding algorithm for paired reads via statistical optimization (2010) ioport