{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:33:38Z","timestamp":1754483618307},"reference-count":11,"publisher":"Oxford University Press (OUP)","issue":"24","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,12,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: In genome assembly, as coverage of sequencing and genome size growing, most current softwares require a large memory for handling a great deal of sequence data. However, most researchers usually cannot meet the requirements of computing resources which prevent most current softwares from practical applications.<\/jats:p>\n               <jats:p>Results: In this article, we present an update algorithm called EPGA2, which applies some new modules and can bring about improved assembly results in small memory. For reducing peak memory in genome assembly, EPGA2 adopts memory-efficient DSK to count K-mers and revised BCALM to construct De Bruijn Graph. Moreover, EPGA2 parallels the step of Contigs Merging and adds Errors Correction in its pipeline. Our experiments demonstrate that all these changes in EPGA2 are more useful for genome assembly.<\/jats:p>\n               <jats:p>Availability and implementation: EPGA2 is publicly available for download at https:\/\/github.com\/bioinfomaticsCSU\/EPGA2.<\/jats:p>\n               <jats:p>Contact: \u00a0jxwang@csu.edu.cn<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btv487","type":"journal-article","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T00:18:54Z","timestamp":1440721134000},"page":"3988-3990","source":"Crossref","is-referenced-by-count":15,"title":["EPGA2: memory-efficient <i>de novo<\/i> assembler"],"prefix":"10.1093","volume":"31","author":[{"given":"Junwei","family":"Luo","sequence":"first","affiliation":[{"name":"1 School of Information Science and Engineering, Central South University, ChangSha, 410083, China,"},{"name":"2 College of Computer Science and Technology, Henan Polytechnic University, JiaoZuo, 454000, China,"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[{"name":"1 School of Information Science and Engineering, Central South University, ChangSha, 410083, China,"}]},{"given":"Weilong","family":"Li","sequence":"additional","affiliation":[{"name":"1 School of Information Science and Engineering, Central South University, ChangSha, 410083, China,"}]},{"given":"Zhen","family":"Zhang","sequence":"additional","affiliation":[{"name":"1 School of Information Science and Engineering, Central South University, ChangSha, 410083, China,"}]},{"given":"Fang-Xiang","family":"Wu","sequence":"additional","affiliation":[{"name":"3 Division of Biomedical Engineering, University of Saskatchewan, Saskatchewan, S7N 5A9, Canada and"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[{"name":"1 School of Information Science and Engineering, Central South University, ChangSha, 410083, China,"}]},{"given":"Yi","family":"Pan","sequence":"additional","affiliation":[{"name":"4 Department of Computer Science, Georgia State University, Atlanta, GA 30302, USA"}]}],"member":"286","published-online":{"date-parts":[[2015,8,26]]},"reference":[{"key":"2023051307184841000_btv487-B1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1093\/bioinformatics\/btq626","article-title":"PE-assembler: de novo assembly using short paired end reads","volume":"27","author":"Ariyaratne","year":"2011","journal-title":"Bioinformatics"},{"key":"2023051307184841000_btv487-B2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-05269-4_4","article-title":"On the representation of de Bruijn graphs","volume-title":"RECOMB","author":"Chikhi","year":"2014"},{"key":"2023051307184841000_btv487-B3","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TST.2013.6616523","article-title":"De\u00a0novo assembly methods for next generation sequencing data","volume":"5","author":"He","year":"2013","journal-title":"Tsinghua Sci. Technol."},{"key":"2023051307184841000_btv487-B4","doi-asserted-by":"crossref","first-page":"1354","DOI":"10.1093\/bioinformatics\/btu030","article-title":"BLESS: bloom filter-based error correction solution for high-throughput sequencing reads","volume":"30","author":"Heo","year":"2014","journal-title":"Bioinformatics"},{"key":"2023051307184841000_btv487-B5","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1186\/2047-217X-1-18","article-title":"SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler","volume":"1","author":"Luo","year":"2012","journal-title":"GigaScience"},{"key":"2023051307184841000_btv487-B6","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1093\/bioinformatics\/btu762","article-title":"EPGA: de novo assembly using the distributions of reads and insert size","volume":"31","author":"Luo","year":"2015","journal-title":"Bioinformatics"},{"key":"2023051307184841000_btv487-B7","doi-asserted-by":"crossref","first-page":"R103","DOI":"10.1186\/gb-2009-10-10-r103","article-title":"ALLPATHS 2: small genomes assembled accurately and with high continuity from short paired reads","volume":"10","author":"MacCallum","year":"2009","journal-title":"Genome Biol."},{"key":"2023051307184841000_btv487-B8","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1093\/bioinformatics\/btt020","article-title":"DSK: k-mer counting with very low memory usage","volume":"29","author":"Rizk","year":"2013","journal-title":"Bioinformatics"},{"key":"2023051307184841000_btv487-B9","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1101\/gr.131383.111","article-title":"GAGE: a critical evaluation of genome assemblies and assembly algorithms","volume":"22","author":"Salzberg","year":"2012","journal-title":"Genome Res."},{"key":"2023051307184841000_btv487-B10","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1101\/gr.089532.108","article-title":"ABySS: a parallel assembler for short-read sequence data","volume":"19","author":"Simpson","year":"2009","journal-title":"Genome Res."},{"key":"2023051307184841000_btv487-B11","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\/31\/24\/3988\/50306985\/bioinformatics_31_24_3988.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/31\/24\/3988\/50306985\/bioinformatics_31_24_3988.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T07:20:01Z","timestamp":1683962401000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/31\/24\/3988\/197171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,26]]},"references-count":11,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2015,12,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btv487","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2015,12,15]]},"published":{"date-parts":[[2015,8,26]]}}}