Please use this identifier to cite or link to this item:
Title: Opera: Reconstructing optimal genomic scaffolds with high-throughput paired-end sequences
Authors: Gao, S.
Sung, W.-K. 
Nagarajan, N.
Keywords: genome assembly
parametric complexity
quadratic programming
Issue Date: 2011
Citation: Gao, S., Sung, W.-K., Nagarajan, N. (2011). Opera: Reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology 18 (11) : 1681-1691. ScholarBank@NUS Repository.
Abstract: 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: © Copyright 2011, Mary Ann Liebert, Inc.
Source Title: Journal of Computational Biology
ISSN: 10665277
DOI: 10.1089/cmb.2011.0170
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Aug 6, 2020


checked on Jul 29, 2020

Page view(s)

checked on Aug 4, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.