Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-20036-6_40
DC FieldValue
dc.titleOpera: Reconstructing optimal genomic scaffolds with high-throughput paired-end sequences
dc.contributor.authorGao, S.
dc.contributor.authorNagarajan, N.
dc.contributor.authorSung, W.-K.
dc.date.accessioned2013-07-04T08:44:17Z
dc.date.available2013-07-04T08:44:17Z
dc.date.issued2011
dc.identifier.citationGao, S.,Nagarajan, N.,Sung, W.-K. (2011). Opera: Reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6577 LNBI : 437-451. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-20036-6_40" target="_blank">https://doi.org/10.1007/978-3-642-20036-6_40</a>
dc.identifier.isbn9783642200359
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/42138
dc.description.abstractScaffolding, 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 gaurantees on the quality of the solution. In this work we explored the feasibility of an exact solution for scaffolding and present a first fixed-parameter tractable solution for assembly (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. © 2011 Springer-Verlag.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-20036-6_40
dc.sourceScopus
dc.subjectFixed-parameter Tractable
dc.subjectGenome Assembly
dc.subjectGraph Algorithms
dc.subjectScaffolding
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1007/978-3-642-20036-6_40
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume6577 LNBI
dc.description.page437-451
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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