Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences

Scaffolding, the problem of ordering and orienting contigs, typically using paired-end reads, is a crucial step in the assembly of high-quality draft genomes. Even as sequencing technologies and mate-pair protocols have improved significantly, scaffolding programs still rely on heuristics, with no guarantees on the quality of the solution. In this work, we explored the feasibility of an exact solution for scaffolding and present a first tractable solution for this problem (Opera). We also describe a graph contraction procedure that allows the solution to scale to large scaffolding problems and demonstrate this by scaffolding several large real and synthetic datasets. In comparisons with existing scaffolders, Opera simultaneously produced longer and more accurate scaffolds demonstrating the utility of an exact approach. Opera also incorporates an exact quadratic programming formulation to precisely compute gap sizes (Availability: http://sourceforge.net/projects/operasf/ ).

[1]  E. Mauceli,et al.  Whole-genome sequence assembly for mammalian genomes: Arachne 2. , 2003, Genome research.

[2]  Daniel H. Huson,et al.  BIOINFORMATICS ORIGINAL PAPER doi:10.1093/bioinformatics/btm153 Genome analysis OSLay: optimal syntenic layout of unfinished assemblies , 2022 .

[3]  Paramvir S. Dehal,et al.  Whole-Genome Shotgun Assembly and Analysis of the Genome of Fugu rubripes , 2002, Science.

[4]  Mihai Pop,et al.  Shotgun Sequence Assembly , 2004, Adv. Comput..

[5]  Mihai Pop,et al.  Scaffolding and validation of bacterial genome assemblies using optical restriction maps , 2008, Bioinform..

[6]  James B. Saxe,et al.  Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time , 1980, SIAM J. Algebraic Discret. Methods.

[7]  D. Haussler,et al.  Assembly of the working draft of the human genome with GigAssembler. , 2001, Genome research.

[8]  J. Mullikin,et al.  The phusion assembler. , 2003, Genome research.

[9]  A. Gnirke,et al.  ALLPATHS 2: small genomes assembled accurately and with high continuity from short paired reads , 2009, Genome Biology.

[10]  Haixu Tang,et al.  Fragment assembly with double-barreled data , 2001, ISMB.

[11]  Eugene W. Myers,et al.  A whole-genome assembly of Drosophila. , 2000, Science.

[12]  Donald J. Bagert Licensing and Certification of Software Professionals , 2004, Adv. Comput..

[13]  Eugene W. Myers,et al.  The greedy path-merging algorithm for contig scaffolding , 2002, JACM.

[14]  Daniel R. Zerbino,et al.  Pebble and Rock Band: Heuristic Resolution of Repeats and Scaffolding in the Velvet Short-Read de Novo Assembler , 2009, PloS one.

[15]  L. Du,et al.  Multiplex sequencing of paired-end ditags (MS-PET): a strategy for the ultra-high-throughput analysis of transcriptomes and genomes , 2006, Nucleic acids research.

[16]  S. Salzberg,et al.  Hierarchical scaffolding with Bambus. , 2003, Genome research.

[17]  S. Turner,et al.  Real-Time DNA Sequencing from Single Polymerase Molecules , 2009, Science.

[18]  Adam M. Phillippy,et al.  Comparative genome assembly , 2004, Briefings Bioinform..

[19]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[20]  Wing-Kin Sung,et al.  A Genomic Survey of Positive Selection in Burkholderia pseudomallei Provides Insights into the Evolution of Accidental Virulence , 2010, PLoS pathogens.

[21]  S. Salzberg,et al.  Versatile and open software for comparing large genomes , 2004, Genome Biology.

[22]  Adel Dayarian,et al.  SOPRA: Scaffolding algorithm for paired reads via statistical optimization , 2010, BMC Bioinformatics.

[23]  Daniel H. Huson,et al.  MetaSim—A Sequencing Simulator for Genomics and Metagenomics , 2008, PloS one.

[24]  Jens Stoye,et al.  Phylogenetic comparative assembly , 2009, Algorithms for Molecular Biology.

[25]  Mark J. P. Chaisson,et al.  De novo fragment assembly with short mate-paired reads: Does the read length matter? , 2009, Genome research.