{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:16:56Z","timestamp":1743121016211,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200359"},{"type":"electronic","value":"9783642200366"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20036-6_40","type":"book-chapter","created":{"date-parts":[[2011,3,23]],"date-time":"2011-03-23T18:49:24Z","timestamp":1300906164000},"page":"437-451","source":"Crossref","is-referenced-by-count":12,"title":["Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences"],"prefix":"10.1007","author":[{"given":"Song","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niranjan","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1093\/nar\/gkl444","volume":"34","author":"P. Ng","year":"2006","unstructured":"Ng, P., Tan, J.J., Ooi, H.S., et al.: Multiplex sequencing of paired-end ditags (MS-PET): A strategy for the ultra-high-throughput analysis of transcriptomes and genomes. Nucleic Acids Research\u00a034, e84 (2006)","journal-title":"Nucleic Acids Research"},{"issue":"5910","key":"40_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1126\/science.1162986","volume":"323","author":"J. Eid","year":"2009","unstructured":"Eid, J., Fehr, A., Gray, J., et al.: Real-time DNA sequencing from single polymerase molecules. Science\u00a0323(5910), 133\u2013138 (2009)","journal-title":"Science"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Dayarian, A., Michael, T.P., Sengupta, A.M.: SOPRA: Scaffolding algorithm for paired reads via statistical optimization. BMC Bioinformatics\u00a011(345) (2010)","DOI":"10.1186\/1471-2105-11-345"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1101\/gr.079053.108","volume":"19","author":"M.J. Chaisson","year":"2009","unstructured":"Chaisson, M.J., Brinza, D., Pevzner, P.A.: De novo fragment assembly with short mate-paired reads: does the read length matter? Genome Research\u00a019, 336\u2013346 (2009)","journal-title":"Genome Research"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Zerbino, D.R., McEwen, G.K., Marguiles, E.H., Birney, E.: Pebble and rock band: heuristic resolution of repeats and scaffolding in the velvet short-read de novo assembler. PLoS ONE\u00a04(12) (2009)","DOI":"10.1371\/journal.pone.0008407"},{"issue":"5","key":"40_CR6","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1145\/585265.585267","volume":"49","author":"D.H. Huson","year":"2002","unstructured":"Huson, D.H., Reinert, K., Myers, E.W.: The greedy path-merging algorithm for contig scaffolding. Journal of the ACM\u00a049(5), 603\u2013615 (2002)","journal-title":"Journal of the ACM"},{"issue":"5461","key":"40_CR7","doi-asserted-by":"publisher","first-page":"2196","DOI":"10.1126\/science.287.5461.2196","volume":"287","author":"E.W. Myers","year":"2000","unstructured":"Myers, E.W., Sutton, G.G., Delcher, A.L., et al.: A whole-genome assembly of Drosophila. Science\u00a0287(5461), 2196\u20132204 (2000)","journal-title":"Science"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1101\/gr.183201","volume":"11","author":"W.J. Kent","year":"2001","unstructured":"Kent, W.J., Haussler, D.: Assembly of the working draft of the human genome with GigAssembler. Genome Research\u00a011, 1541\u20131548 (2001)","journal-title":"Genome Research"},{"issue":"S1","key":"40_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1093\/bioinformatics\/17.suppl_1.S225","volume":"17","author":"P.A. Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H.: Fragment assembly with double-barreled data. Bioinformatics\u00a017(S1), 225\u2013233 (2001)","journal-title":"Bioinformatics"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1101\/gr.1536204","volume":"14","author":"M. Pop","year":"2004","unstructured":"Pop, M., Kosack, S.D., Salzberg, S.L.: Hierarchical scaffolding with bambus. Genome Research\u00a014, 149\u2013159 (2004)","journal-title":"Genome Research"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1101\/gr.731003","volume":"13","author":"J.C. Mullikin","year":"2003","unstructured":"Mullikin, J.C., Ning, Z.: The phusion assembler. Genome Research\u00a013, 81\u201390 (2003)","journal-title":"Genome Research"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1101\/gr.828403","volume":"13","author":"D.B. Jaffe","year":"2003","unstructured":"Jaffe, D.B., Butler, J., Gnerre, S., et al.: Whole-genome sequence assembly for mammalian genomes: Arachne 2. Genome Research\u00a013, 91\u201396 (2003)","journal-title":"Genome Research"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1126\/science.1072104","volume":"297","author":"S. Aparicio","year":"2002","unstructured":"Aparicio, S., Chapma, J., Stupka, E., et al.: Whole-genome shotgun assembly and analysis of the genome of Fugu rubripes. Science\u00a0297, 1301\u20131310 (2002)","journal-title":"Science"},{"issue":"3","key":"40_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1093\/bib\/5.3.237","volume":"5","author":"M. Pop","year":"2004","unstructured":"Pop, M., Phillipy, A., Delcher, A.L., Salzberg, S.L.: Comparative genome assembly. Briefings in Bioinformatics\u00a05(3), 237\u2013248 (2004)","journal-title":"Briefings in Bioinformatics"},{"issue":"13","key":"40_CR15","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1093\/bioinformatics\/btm153","volume":"23","author":"D.C. Richter","year":"2007","unstructured":"Richter, D.C., Schuster, S.C., Huson, D.H.: OSLay: optimal syntenic layout of unfinished assemblies. Bioinformatics\u00a023(13), 1573\u20131579 (2007)","journal-title":"Bioinformatics"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Husemann, P., Stoye, J.: Phylogenetic comparative assembly. Algorithms for Molecular Biology\u00a05(3) (2010)","DOI":"10.1186\/1748-7188-5-3"},{"issue":"10","key":"40_CR17","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1093\/bioinformatics\/btn102","volume":"24","author":"N. Nagarajan","year":"2008","unstructured":"Nagarajan, N., Read, T.D., Pop, M.: Scaffolding and validation of bacterial genome assemblies using optical restriction maps. Bioinformatics\u00a024(10), 1229\u20131235 (2008)","journal-title":"Bioinformatics"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Pop, M.: Shotgun sequence assembly. Advances in Computers\u00a060 (2004)","DOI":"10.1016\/S0065-2458(03)60006-9"},{"issue":"4","key":"40_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"J. Saxe","year":"1980","unstructured":"Saxe, J.: Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. on Algebraic and Discrete Methodd\u00a01(4), 363\u2013369 (1980)","journal-title":"SIAM J. on Algebraic and Discrete Methodd"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming\u00a027 (1983)","DOI":"10.1007\/BF02591962"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"Richter, D.C., Ott, F., Schmid, R., Huson, D.H.: Metasim: a sequencing simulator for genomics and metagenomics. PloS One\u00a03(10) (2008)","DOI":"10.1371\/journal.pone.0003373"},{"key":"40_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1186\/gb-2009-10-10-r103","volume":"10","author":"I. MacCallum","year":"2009","unstructured":"MacCallum, I., Przybylksi, D., Gnerre, S., et al.: ALLPATHS2: small genomes assembled accurately and with high continuity from short paired reads. Genome Biology\u00a010, R103 (2009)","journal-title":"Genome Biology"},{"key":"40_CR23","doi-asserted-by":"crossref","unstructured":"Nandi, T., Ong, C., Singh, A.P., et al.: A genomic survey of positive selection in Burkholderia pseudomallei provides insights into the evolution of accidental virulence. PLoS Pathogens\u00a06(4) (2010)","DOI":"10.1371\/journal.ppat.1000845"},{"key":"40_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/gb-2004-5-2-r12","volume":"5","author":"S.A. Kurtz","year":"2004","unstructured":"Kurtz, S.A., Phillippy, A., Delcher, A.L., et al.: Versatile and open software for comparing large genomes. Genome Biology\u00a05, R12 (2004)","journal-title":"Genome Biology"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20036-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:52:58Z","timestamp":1558295578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20036-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200359","9783642200366"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20036-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}