{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:11:20Z","timestamp":1773274280425,"version":"3.50.1"},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"20","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Genomic repositories are rapidly growing, as witnessed by the 1000 Genomes or the UK10K projects. Hence, compression of multiple genomes of the same species has become an active research area in the past years. The well-known large redundancy in human sequences is not easy to exploit because of huge memory requirements from traditional compression algorithms.<\/jats:p>\n               <jats:p>Results: We show how to obtain several times higher compression ratio than of the best reported results, on two large genome collections (1092 human and 775 plant genomes). Our inputs are variant call format files restricted to their essential fields. More precisely, our novel Ziv-Lempel-style compression algorithm squeezes a single human genome to \u223c400 KB. The key to high compression is to look for similarities across the whole collection, not just against one reference sequence, what is typical for existing solutions.<\/jats:p>\n               <jats:p>Availability: \u00a0http:\/\/sun.aei.polsl.pl\/tgc (also as Supplementary Material) under a free license.<\/jats:p>\n               <jats:p>Supplementary data: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <jats:p>Contact: \u00a0sebastian.deorowicz@polsl.pl<\/jats:p>","DOI":"10.1093\/bioinformatics\/btt460","type":"journal-article","created":{"date-parts":[[2013,8,23]],"date-time":"2013-08-23T00:58:43Z","timestamp":1377219523000},"page":"2572-2578","source":"Crossref","is-referenced-by-count":45,"title":["Genome compression: a novel approach for large collections"],"prefix":"10.1093","volume":"29","author":[{"given":"Sebastian","family":"Deorowicz","sequence":"first","affiliation":[{"name":"1 Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland and 2Computer Engineering Department, Technical University of \u0141\u00f3d\u017a, Al. Politechniki 11, 90-924 \u0141\u00f3d\u017a, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agnieszka","family":"Danek","sequence":"additional","affiliation":[{"name":"1 Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland and 2Computer Engineering Department, Technical University of \u0141\u00f3d\u017a, Al. Politechniki 11, 90-924 \u0141\u00f3d\u017a, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szymon","family":"Grabowski","sequence":"additional","affiliation":[{"name":"1 Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland and 2Computer Engineering Department, Technical University of \u0141\u00f3d\u017a, Al. Politechniki 11, 90-924 \u0141\u00f3d\u017a, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2013,8,21]]},"reference":[{"key":"2023012810470065400_btt460-B1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1038\/nature11632","article-title":"An integrated map of genetic variation from 1092 human genomes","volume":"491","author":"The 1000 Genome Project Consortium","year":"2012","journal-title":"Nature"},{"key":"2023012810470065400_btt460-B2","doi-asserted-by":"crossref","first-page":"11920","DOI":"10.1073\/pnas.1201904109","article-title":"A public resource facilitating clinical use of genomes","volume":"109","author":"Ball","year":"2012","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012810470065400_btt460-B3","doi-asserted-by":"crossref","first-page":"e59190","DOI":"10.1371\/journal.pone.0059190","article-title":"Compression of FASTQ and SAM format sequencing data","volume":"8","author":"Bonfield","year":"2013","journal-title":"PLoS One"},{"key":"2023012810470065400_btt460-B4","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1093\/bioinformatics\/bts173","article-title":"Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform","volume":"28","author":"Cox","year":"2012","journal-title":"Bioinformatics"},{"key":"2023012810470065400_btt460-B5","first-page":"4352","article-title":"A simple statistical algorithm for biological sequence compression","volume-title":"Proceedings of the Data Compression Conference IEEE Computer Society Press","author":"Cao","year":"2007"},{"key":"2023012810470065400_btt460-B6","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1093\/bioinformatics\/btn582","article-title":"Human genomes as email attachments","volume":"25","author":"Christley","year":"2009","journal-title":"Bioinformatics"},{"key":"2023012810470065400_btt460-B7","first-page":"86","article-title":"Compressed q-gram indexing for highly repetitive biological sequences","volume-title":"Proceedings of the 10th IEEE Conference on Bioinformatics and Bioengineering","author":"Claude","year":"2010"},{"key":"2023012810470065400_btt460-B8","doi-asserted-by":"crossref","first-page":"2156","DOI":"10.1093\/bioinformatics\/btr330","article-title":"The variant call format and VCFtools","volume":"27","author":"Danecek","year":"2011","journal-title":"Bioinformatics"},{"key":"2023012810470065400_btt460-B9","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":"2023012810470065400_btt460-B10","first-page":"291","article-title":"Fast relative Lempel-Ziv self-index for similar sequences","volume-title":"Proceedings of the Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (FAW-AAIM)","author":"Do","year":"2012"},{"key":"2023012810470065400_btt460-B11","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-642-28332-1_21","article-title":"A faster grammar-based self-index","volume-title":"Proceedings of the 6th International Conference on Language and Automata Theory and Applications","author":"Gagie","year":"2012"},{"key":"2023012810470065400_btt460-B12","first-page":"653","article-title":"Faster approximate pattern matching in compressed repetitive texts","volume-title":"Proceedings of the 22nd International Symposium on Algorithms and Computation","author":"Gagie","year":"2011"},{"key":"2023012810470065400_btt460-B13","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1093\/bioinformatics\/bts593","article-title":"SCALCE: boosting sequence compression algorithms using locally consistent encoding","volume":"28","author":"Hach","year":"2012","journal-title":"Bioinformatics"},{"key":"2023012810470065400_btt460-B14","doi-asserted-by":"crossref","first-page":"e171","DOI":"10.1093\/nar\/gks754","article-title":"Compression of next-generation sequencing reads aided by highly efficient de novo assembly","volume":"40","author":"Jones","year":"2012","journal-title":"Nucleic Acids Res."},{"key":"2023012810470065400_btt460-B15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2012.02.006","article-title":"On compressing and indexing repetitive sequences","volume":"483","author":"Kreft","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"2023012810470065400_btt460-B16","first-page":"91","article-title":"Optimized relative Lempel-Ziv compression of genomes","volume-title":"Proceedings of the ACSC Australasian Computer Science Conference","author":"Kuruppu","year":"2011"},{"key":"2023012810470065400_btt460-B17","doi-asserted-by":"crossref","first-page":"e254","DOI":"10.1371\/journal.pbio.0050254","article-title":"The diploid genome sequence of an individual human","volume":"5","author":"Levy","year":"2007","journal-title":"PLoS Biol."},{"key":"2023012810470065400_btt460-B18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1089\/cmb.2009.0169","article-title":"Storage and retrieval of highly repetitive sequence collections","volume":"17","author":"M\u00e4kinen","year":"2010","journal-title":"J. Comput. Biol."},{"key":"2023012810470065400_btt460-B19","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1002\/spe.619","article-title":"A simple and fast DNA compressor","volume":"34","author":"Manzini","year":"2004","journal-title":"Software Pract. Ex."},{"key":"2023012810470065400_btt460-B20","doi-asserted-by":"crossref","first-page":"2199","DOI":"10.1093\/bioinformatics\/btt362","article-title":"The human genome contracts again","volume":"29","author":"Pavlichin","year":"2013","journal-title":"Bioinformatics"},{"key":"2023012810470065400_btt460-B21","doi-asserted-by":"crossref","first-page":"e21588","DOI":"10.1371\/journal.pone.0021588","article-title":"On the representability of complete genomes by multiple competing finite-context (Markov) models","volume":"6","author":"Pinho","year":"2011","journal-title":"PLoS One"},{"key":"2023012810470065400_btt460-B22","doi-asserted-by":"crossref","first-page":"e27","DOI":"10.1093\/nar\/gkr1124","article-title":"GReEn: a tool for efficient compression of genome resequencing data","volume":"40","author":"Pinho","year":"2012","journal-title":"Nucleic Acids Res."},{"key":"2023012810470065400_btt460-B23","doi-asserted-by":"crossref","first-page":"e27","DOI":"10.1093\/nar\/gks939","article-title":"NGC: lossless and lossy compression of aligned high-throughput sequencing data","volume":"41","author":"Popitsch","year":"2013","journal-title":"Nucleic Acids Res."},{"key":"2023012810470065400_btt460-B24","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1186\/1471-2105-13-100","article-title":"Handling the data management needs of high-throughput sequencing data: SpeedGene, a compression algorithm for the efficient storage of genetic data","volume":"13","author":"Qiao","year":"2012","journal-title":"BMC Bioinformatics"},{"key":"2023012810470065400_btt460-B25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-903-9","volume-title":"Handbook of data compression","author":"Salomon","year":"2010"},{"key":"2023012810470065400_btt460-B26","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1145\/322344.322346","article-title":"Data compression via textual substitution","volume":"29","author":"Storer","year":"1982","journal-title":"J. ACM"},{"key":"2023012810470065400_btt460-B27","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1186\/1748-7188-7-30","article-title":"Adaptive efficient compression of genomes","volume":"7","author":"Wandelt","year":"2012","journal-title":"Algorithms Mol. Biol."}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/29\/20\/2572\/48892976\/bioinformatics_29_20_2572.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/29\/20\/2572\/48892976\/bioinformatics_29_20_2572.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:39:25Z","timestamp":1674909565000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/29\/20\/2572\/278528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,21]]},"references-count":27,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2013,10,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btt460","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2013,10,15]]},"published":{"date-parts":[[2013,8,21]]}}}