{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T23:29:03Z","timestamp":1700609343978},"reference-count":6,"publisher":"Oxford University Press (OUP)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Data compression is crucial in effective handling of genomic data. Among several recently published algorithms, ERGC seems to be surprisingly good, easily beating all of the competitors.<\/jats:p>\n               <jats:p>Results: We evaluated ERGC and the previously proposed algorithms GDC and iDoComp, which are the ones used in the original paper for comparison, on a wide data set including 12 assemblies of human genome (instead of only four of them in the original paper). ERGC wins only when one of the genomes (referential or target) contains mixed-cased letters (which is the case for only the two Korean genomes). In all other cases ERGC is on average an order of magnitude worse than GDC and iDoComp.<\/jats:p>\n               <jats:p>Contact: \u00a0sebastian.deorowicz@polsl.pl, iochoa@stanford.edu<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btv704","type":"journal-article","created":{"date-parts":[[2015,11,29]],"date-time":"2015-11-29T01:08:39Z","timestamp":1448759319000},"page":"1115-1117","source":"Crossref","is-referenced-by-count":3,"title":["Comment on: \u2018ERGC: an efficient referential genome compression algorithm\u2019"],"prefix":"10.1093","volume":"32","author":[{"given":"Sebastian","family":"Deorowicz","sequence":"first","affiliation":[{"name":"1 Institute of Informatics, Silesian University of Technology, Akademicka 16, Gliwice, 44-100 Poland,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szymon","family":"Grabowski","sequence":"additional","affiliation":[{"name":"2 Institute of Applied Computer Science, Lodz University of Technology, Al. Politechniki 11, 90-924 \u0141\u00f3d\u017a, Poland and"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idoia","family":"Ochoa","sequence":"additional","affiliation":[{"name":"3 Department of Electrical Engineering, Stanford University, 350 Serra Mall, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikel","family":"Hernaez","sequence":"additional","affiliation":[{"name":"3 Department of Electrical Engineering, Stanford University, 350 Serra Mall, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsachy","family":"Weissman","sequence":"additional","affiliation":[{"name":"3 Department of Electrical Engineering, Stanford University, 350 Serra Mall, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"key":"2023020111593286300_btv704-B1","article-title":"GDC 2: Compression of large collections of genomes,","volume":"5","author":"Deorowicz","year":"2015","journal-title":"Sci. Reports"},{"key":"2023020111593286300_btv704-B2","doi-asserted-by":"crossref","first-page":"2979","DOI":"10.1093\/bioinformatics\/btr505","article-title":"Robust relative compression of genomes with random access,","volume":"27","author":"Deorowicz","year":"2011","journal-title":"Bioinformatics"},{"key":"2023020111593286300_btv704-B3","unstructured":"Kuruppu\n              S.\n            \n          \n          \u00a0et al.. (2011) Optimized relative Lempel-Ziv compression of genomes. In: ReynoldsM. (ed.) Proceedings of the ACSC Australasian Computer Science Conference. Australian Computer Society, Inc., Sydney, Australia, pp. 91\u201398."},{"key":"2023020111593286300_btv704-B4","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1093\/bioinformatics\/btu698","article-title":"iDoComp: a compression scheme for assembled genomes","volume":"31","author":"Ochoa","year":"2015","journal-title":"Bioinformatics"},{"key":"2023020111593286300_btv704-B5","first-page":"3468","article-title":"ERGC: An efficient referential genome compression algorithm","volume-title":"Bioinformatics","author":"Saha","year":"2015"},{"key":"2023020111593286300_btv704-B6","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1109\/TCBB.2013.122","article-title":"FRESCO: Referential compression of highly similar sequences,","volume":"10","author":"Wandelt","year":"2013","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/32\/7\/1115\/49018322\/bioinformatics_32_7_1115.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/32\/7\/1115\/49018322\/bioinformatics_32_7_1115.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T22:16:07Z","timestamp":1675289767000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/32\/7\/1115\/2240515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,28]]},"references-count":6,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,4,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btv704","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2016,4,1]]},"published":{"date-parts":[[2015,11,28]]}}}