Opera: Reconstructing optimal genomic scaffolds with high-throughput paired-end sequences

Journal of Computational Biology

Volumn 18, Issue 11, 2011, Pages 1681-1691

  Gao, Song ^a   Sung, Wing Kin ^b,c   Nagarajan, Niranjan ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

genome assembly; parametric complexity; quadratic programming; scaffolding

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BURKHOLDERIA PSEUDOMALLEI; COMPARATIVE STUDY; COMPUTER PROGRAM; COMPUTER SIMULATION; CONTIG MAPPING; DNA SEQUENCE; ESCHERICHIA COLI; GENETICS; GENOME; HIGH THROUGHPUT SEQUENCING; HUMAN; METHODOLOGY; SACCHAROMYCES CEREVISIAE;

ALGORITHMS; BURKHOLDERIA PSEUDOMALLEI; COMPUTER SIMULATION; CONTIG MAPPING; ESCHERICHIA COLI; GENOME; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; MODELS, GENETIC; SACCHAROMYCES CEREVISIAE; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 80955159932     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2011.0170     Document Type: Article

References (24)

1. Aparicio, S., Chapma, J., Stupka, E., et al. 2002. Whole-genome shotgun assembly and analysis of the genome of Fugu rubripes. Science 297, 1301-1310. (Pubitemid 34913162)
2. Chaisson, M. J., Brinza, D., and Pevzner, P. A. 2009. De novo fragment assembly with short mate-paired reads: does the read length matter? Genome Res. 19, 336-346.
3. Dayarian, A., Michael, T. P., and Sengupta, A. M. 2010. SOPRA: scaffolding algorithm for paired reads via statistical optimization. BMC Bioinform. 11, 345.
4. Eid, J., Fehr, A., Gray, J., et al. 2009. Real-time DNA sequencing from single polymerase molecules. Science 323, 133-138.
5. Husemann, P., and Stoye, J. 2010. Phylogenetic comparative assembly. Alg. Mol. Biol. 5, 3.
6. Goldfarb, D., and Idnani, A. 1983. A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27.
7. Huson, D. H., Reinert, K., and Myers, E. W. 2002. The greedy path-merging algorithm for contig scaffolding. J ACM 49, 603-615.
8. Jaffe, D. B., Butler, J., Gnerre, S., et al. 2003. Whole-genome sequence assembly for mammalian genomes: Arachne 2. Genome Res. 13, 91-96.
9. Kent, W. J., and Haussler, D. 2001. Assembly of the working draft of the human genome with GigAssembler. Genome Res. 11, 1541-1548. (Pubitemid 32894679)
10. Kurtz, S. A., Phillippy, A., Delcher, A. L., et al. 2004. Versatile and open software for comparing large genomes. Genome Biol. 5, R12.
11. MacCallum, I., Przybylksi, D., Gnerre, S., et al. 2009. ALLPATHS2: small genomes assembled accurately and with high continuity from short paired reads. Genome Biol. 10, R103.
12. Mullikin, J. C., and Ning, Z. 2003. The phusion assembler. Genome Res. 13, 81-90.
13. Myers, E. W., Sutton, G. G., Delcher, A. L., et al. 2000. A whole-genome assembly of Drosophila. Science 287, 2196-2204. (Pubitemid 30177014)
14. Nagarajan, N., Read, T. D., and Pop, M. 2008. Scaffolding and validation of bacterial genome assemblies using optical restriction maps. Bioinformatics 24, 1229-1235. (Pubitemid 351659618)
15. Nandi, T., Ong, C., Singh, A. P., et al. 2010. A genomic survey of positive selection in Burkholderia pseudomallei provides insights into the evolution of accidental virulence. PLoS Pathogens 6, 4.
16. Ng, P., Tan, J. J., Ooi, H. S., et al. 2006. Multiplex sequencing of paired-end ditags (MS-PET): a strategy for the ultra-high-throughput analysis of transcriptomes and genomes. Nucleic Acids Res. 34, e84.
17. Pevzner, P. A., and Tang, H. 2001. Fragment assembly with double-barreled data. Bioinformatics 17, 225-233.
18. Pop, M., Kosack, S. D., and Salzberg, S. L. 2004. Hierarchical scaffolding with bambus. Genome Res. 14, 149-159. (Pubitemid 38088536)
19. Pop, M., Phillipy, A., Delcher, A. L., et al. 2004. Comparative genome assembly. Brief. Bioinform. 5, 237-248.
20. Pop, M. 2004. Shotgun sequence assembly. Adv. Computers 60, 1.
21. Richter, D. C., Schuster, S. C., and Huson, D. H. 2007. OSLay: optimal syntenic layout of unfinished assemblies. Bioinformatics 23, 1573-1579. (Pubitemid 47244446)
22. Richter, D. C., Ott, F., Schmid, R., et al. 2008. Metasim: a sequencing simulator for genomics and metagenomics. PloS One 3, 10.
23. Saxe, J. 1980. Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic Discr. Methods 1, 363-369.
24. Zerbino, D. R., McEwen, G. K., Marguiles, E. H., et al. 2009. Pebble and rock band: heuristic resolution of repeats and scaffolding in the velvet short-read de novo assembler. PLoS ONE 4, 12.