{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T18:11:42Z","timestamp":1763057502239},"reference-count":9,"publisher":"Oxford University Press (OUP)","issue":"17","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: The shorter and vastly more numerous reads produced by second-generation sequencing technologies require new tools that can assemble massive numbers of reads in reasonable time. Existing short-read assembly tools can be classified into two categories: greedy extension-based and graph-based. While the graph-based approaches are generally superior in terms of assembly quality, the computer resources required for building and storing a huge graph are very high. In this article, we present Taipan, an assembly algorithm which can be viewed as a hybrid of these two approaches. Taipan uses greedy extensions for contig construction but at each step realizes enough of the corresponding read graph to make better decisions as to how assembly should continue. We show that this approach can achieve an assembly quality at least as good as the graph-based approaches used in the popular Edena and Velvet assembly tools using a moderate amount of computing resources.<\/jats:p>\n               <jats:p>Availability and Implementation: Source code in C running on Linux is freely available at http:\/\/taipan.sourceforge.net<\/jats:p>\n               <jats:p>Contact: \u00a0asbschmidt@ntu.edu.sg<\/jats:p>","DOI":"10.1093\/bioinformatics\/btp374","type":"journal-article","created":{"date-parts":[[2009,6,18]],"date-time":"2009-06-18T01:45:34Z","timestamp":1245289534000},"page":"2279-2280","source":"Crossref","is-referenced-by-count":43,"title":["A fast hybrid short read fragment assembly algorithm"],"prefix":"10.1093","volume":"25","author":[{"given":"Bertil","family":"Schmidt","sequence":"first","affiliation":[{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore 639798, 2 Department of Computer Science and Software Engineering, University of Melbourne, 3 National ICT Australia, Victoria Research Lab, Victoria 3010 and 4 School of Computer Science and IT, RMIT University, Melbourne 3001, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranjan","family":"Sinha","sequence":"additional","affiliation":[{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore 639798, 2 Department of Computer Science and Software Engineering, University of Melbourne, 3 National ICT Australia, Victoria Research Lab, Victoria 3010 and 4 School of Computer Science and IT, RMIT University, Melbourne 3001, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bryan","family":"Beresford-Smith","sequence":"additional","affiliation":[{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore 639798, 2 Department of Computer Science and Software Engineering, University of Melbourne, 3 National ICT Australia, Victoria Research Lab, Victoria 3010 and 4 School of Computer Science and IT, RMIT University, Melbourne 3001, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore 639798, 2 Department of Computer Science and Software Engineering, University of Melbourne, 3 National ICT Australia, Victoria Research Lab, Victoria 3010 and 4 School of Computer Science and IT, RMIT University, Melbourne 3001, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2009,6,17]]},"reference":[{"key":"2023013112105123800_B1","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1101\/gr.7088808","article-title":"A short read fragment assembly of bacterial genomes","volume":"18","author":"Chaisson","year":"2008","journal-title":"Genome Res."},{"key":"2023013112105123800_B2","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1101\/gr.6435207","article-title":"SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic assembly","volume":"17","author":"Dohm","year":"2007","journal-title":"Genome Res."},{"key":"2023013112105123800_B3","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1101\/gr.072033.107","article-title":"De novo bacterial genome sequencing: millions of very short reads assembled on a desktop computer","volume":"18","author":"Hernandez","year":"2008","journal-title":"Genome Res."},{"key":"2023013112105123800_B4","doi-asserted-by":"crossref","first-page":"2942","DOI":"10.1093\/bioinformatics\/btm451","article-title":"Extending assembly of short DNA sequences to handle error","volume":"23","author":"Jeck","year":"2007","journal-title":"Bioinformatics"},{"key":"2023013112105123800_B5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.tig.2007.12.007","article-title":"The impact of next generation sequencing on genetics","volume":"24","author":"Mardis","year":"2008","journal-title":"Trends Genet."},{"key":"2023013112105123800_B6","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.tig.2007.12.006","article-title":"Bioinformatics challenges of new sequencing technology","volume":"24","author":"Pop","year":"2008","journal-title":"Trends Genet."},{"key":"2023013112105123800_B7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1186\/1471-2105-6-31","article-title":"Automated generation of heuristics for biological sequence comparison","volume":"6","author":"Slater","year":"2005","journal-title":"BMC Bioinformatics"},{"key":"2023013112105123800_B8","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1093\/bioinformatics\/btl629","article-title":"Assembling millions of short DNA sequences using SSAKE","volume":"23","author":"Warren","year":"2007","journal-title":"Bioinformatics"},{"key":"2023013112105123800_B9","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1101\/gr.074492.107","article-title":"Velvet: algorithms for de novo short read assembly using de Bruijn graphs","volume":"18","author":"Zerbino","year":"2008","journal-title":"Genome Res."}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/17\/2279\/48994604\/bioinformatics_25_17_2279.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/17\/2279\/48994604\/bioinformatics_25_17_2279.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T21:33:03Z","timestamp":1675200783000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/25\/17\/2279\/210232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,17]]},"references-count":9,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2009,9,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btp374","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2009,9,1]]},"published":{"date-parts":[[2009,6,17]]}}}