{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:45:02Z","timestamp":1740145502810,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T00:00:00Z","timestamp":1559520000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T00:00:00Z","timestamp":1559520000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Source Code Biol Med"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13029-019-0073-5","type":"journal-article","created":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T18:10:47Z","timestamp":1559585447000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["MZPAQ: a FASTQ data compression tool"],"prefix":"10.1186","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4561-2161","authenticated-orcid":false,"given":"Achraf","family":"El Allali","sequence":"first","affiliation":[]},{"given":"Mariam","family":"Arshad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,3]]},"reference":[{"issue":"12","key":"73_CR1","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1038\/nmeth.4037","volume":"13","author":"Ibrahim Numanagi\u0107","year":"2016","unstructured":"Numanagi\u0107 I, Bonfield JK, Hach F, Voges J, Ostermann J, Alberti C, Mattavelli M, Sahinalp SC. Comparison of high-throughput sequencing data compression tools. Nat Methods; 12:1005\u20138. \n                    https:\/\/doi.org\/10.1038\/nmeth.4037\n                    \n                  .","journal-title":"Nature Methods"},{"issue":"19","key":"73_CR2","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1093\/bioinformatics\/bts467","volume":"28","author":"MH Mohammed","year":"2012","unstructured":"Mohammed MH, Dutta A, Bose T, Chadaram S, Mande SS. DELIMINATE\u2013a fast and efficient method for loss-less compression of genomic sequences: sequence analysis. Bioinformatics (Oxford, England). 2012; 28(19):2527\u20139. \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/bts467\n                    \n                  .","journal-title":"Bioinformatics (Oxford, England)"},{"issue":"1","key":"73_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/bioinformatics\/btt594","volume":"30","author":"AJ Pinho","year":"2014","unstructured":"Pinho AJ, Pratas D. Mfcompress: A compression tool for fasta and multi-fasta data. Bioinformatics. 2014; 30(1):117\u20138. \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/btt594\n                    \n                  .","journal-title":"Bioinformatics"},{"issue":"4","key":"73_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.3390\/info7040056","volume":"7","author":"M Hosseini","year":"2016","unstructured":"Hosseini M, Pratas D, Pinho A. A Survey on Data Compression Methods for Biological Sequences. Information. 2016; 7(4):56. \n                    https:\/\/doi.org\/10.3390\/info7040056\n                    \n                  .","journal-title":"Information"},{"issue":"23","key":"73_CR5","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1093\/bioinformatics\/bts593","volume":"28","author":"F Hach","year":"2012","unstructured":"Hach F, Numanagi\u0107 I, Alkan C, Sahinalp SC. SCALCE: Boosting sequence compression algorithms using locally consistent encoding. Bioinformatics. 2012; 28(23):3051\u20137. \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/bts593\n                    \n                  .","journal-title":"Bioinformatics"},{"issue":"1","key":"73_CR6","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1186\/s12859-015-0709-7","volume":"16","author":"G Benoit","year":"2015","unstructured":"Benoit G, Lemaitre C, Lavenier D, Drezen E, Dayris T, Uricaru R, Rizk G. Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph. BMC Bioinformatics. 2015; 16(1):288. \n                    https:\/\/doi.org\/10.1186\/s12859-015-0709-7\n                    \n                  . 1412.5932.","journal-title":"BMC Bioinformatics"},{"issue":"22","key":"73_CR7","doi-asserted-by":"publisher","first-page":"e171","DOI":"10.1093\/nar\/gks754","volume":"40","author":"Daniel C. Jones","year":"2012","unstructured":"Jones DC, Ruzzo WL, Peng X, Katze MG. Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic Acids Res. 2012;40(22). \n                    https:\/\/doi.org\/10.1093\/nar\/gks754\n                    \n                  . 1207.2424.","journal-title":"Nucleic Acids Research"},{"issue":"20","key":"73_CR8","doi-asserted-by":"publisher","first-page":"3276","DOI":"10.1093\/bioinformatics\/btv384","volume":"31","author":"M Nicolae","year":"2015","unstructured":"Nicolae M, Pathak S, Rajasekaran S. LFQC: A lossless compression algorithm for FASTQ files. Bioinformatics. 2015; 31(20):3276\u201381. \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/btv384\n                    \n                  .","journal-title":"Bioinformatics"},{"issue":"3","key":"73_CR9","doi-asserted-by":"publisher","first-page":"e59190","DOI":"10.1371\/journal.pone.0059190","volume":"8","author":"James K. Bonfield","year":"2013","unstructured":"Bonfield JK, Mahoney MV. Compression of FASTQ and SAM Format Sequencing Data. PLoS ONE. 2013;8(3). \n                    https:\/\/doi.org\/10.1371\/journal.pone.0059190\n                    \n                  .","journal-title":"PLoS ONE"},{"key":"73_CR10","volume-title":"FQZip: Lossless Reference-Based Compression of Next Generation Sequencing Data in FASTQ Format","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Li L, Xiao J, Yang Y, Zhu Z. FQZip: Lossless Reference-Based Compression of Next Generation Sequencing Data in FASTQ Format. Cham: Springer; 2015, pp. 127\u201335."},{"key":"73_CR11","unstructured":"Collin L. A quick benchmark: Gzip vs. Bzip2 vs. LZMA. 2005. \n                    https:\/\/tukaani.org\/lzma\/benchmarks.html\n                    \n                  ."},{"issue":"3","key":"73_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv J, Lempel A. A Universal Algorithm for Sequential Data Compression. IEEE Trans Inf Theory. 1977; 23(3):337\u201343. \n                    https:\/\/doi.org\/10.1109\/TIT.1977.1055714\n                    \n                  .","journal-title":"IEEE Trans Inf Theory"},{"issue":"12","key":"73_CR13","doi-asserted-by":"publisher","first-page":"4696","DOI":"10.1007\/s11227-016-1753-4","volume":"72","author":"A Guerra","year":"2016","unstructured":"Guerra A, Lotero J, Isaza S. Performance comparison of sequential and parallel compression applications for DNA raw data. J Supercomput. 2016; 72(12):4696\u2013717. \n                    https:\/\/doi.org\/10.1007\/s11227-016-1753-4\n                    \n                  .","journal-title":"J Supercomput"},{"issue":"3","key":"73_CR14","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1093\/bib\/bbt088","volume":"15","author":"R Giancarlo","year":"2014","unstructured":"Giancarlo R, Rombo SE, Utro F. Compressive biological sequence analysis and archival in the era of high-throughput sequencing technologies. Brief Bioinforma. 2014; 15(3):390\u2013406. \n                    https:\/\/doi.org\/10.1093\/bib\/bbt088\n                    \n                  .","journal-title":"Brief Bioinforma"},{"issue":"03","key":"73_CR15","doi-asserted-by":"publisher","first-page":"1630002","DOI":"10.1142\/S0219720016300021","volume":"14","author":"M Sardaraz","year":"2016","unstructured":"Sardaraz M, Tahir M, Ikram AA. Advances in high throughput DNA sequence data compression. J Bioinforma Comput Biol. 2016; 14(03):1630002. \n                    https:\/\/doi.org\/10.1142\/S0219720016300021\n                    \n                  .","journal-title":"J Bioinforma Comput Biol"},{"key":"73_CR16","first-page":"1","volume":"CS-2005-16","author":"MV Mahoney","year":"2005","unstructured":"Mahoney MV. Adaptive weighing of context models for lossless data compression. Florida Inst Technol Melb, USA. 2005; CS-2005-16:1\u20136.","journal-title":"Florida Inst Technol Melb, USA"},{"key":"73_CR17","doi-asserted-by":"publisher","unstructured":"Alberti C, Daniels N, Hernaez M, Voges J, Goldfeder RL, Hernandez-Lopez AA, Mattavelli M, Berger B. An Evaluation Framework for Lossy Compression of Genome Sequencing Quality Values. In: Data Compression Conference Proceedings: 2016. p. 221\u201330. \n                    https:\/\/doi.org\/10.1109\/DCC.2016.39\n                    \n                  .","DOI":"10.1109\/DCC.2016.39"},{"issue":"20","key":"73_CR18","doi-asserted-by":"publisher","first-page":"3124","DOI":"10.1093\/bioinformatics\/btw385","volume":"32","author":"DL Greenfield","year":"2016","unstructured":"Greenfield DL, Stegle O, Rrustemi A. GeneCodeq: Quality score compression and improved genotyping using a Bayesian framework. Bioinformatics. 2016; 32(20):3124\u201332. \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/btw385\n                    \n                  .","journal-title":"Bioinformatics"},{"issue":"20","key":"73_CR19","doi-asserted-by":"publisher","first-page":"3276","DOI":"10.1093\/bioinformatics\/btv384","volume":"31","author":"M Nicolae","year":"2015","unstructured":"Nicolae M, Pathak S, Rajasekaran S. LFQC: a lossless compression algorithm for FASTQ files. Bioinformatics. 2015; 31(20):3276\u201381. \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/btv384\n                    \n                  .","journal-title":"Bioinformatics"},{"key":"73_CR20","unstructured":"Numanagi I. Boosting high throughput sequencing data compression algorithms using reordering. 2013."}],"container-title":["Source Code for Biology and Medicine"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13029-019-0073-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13029-019-0073-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13029-019-0073-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:06:26Z","timestamp":1591056386000},"score":1,"resource":{"primary":{"URL":"https:\/\/scfbm.biomedcentral.com\/articles\/10.1186\/s13029-019-0073-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["73"],"URL":"https:\/\/doi.org\/10.1186\/s13029-019-0073-5","relation":{},"ISSN":["1751-0473"],"issn-type":[{"type":"electronic","value":"1751-0473"}],"subject":[],"published":{"date-parts":[[2019,6,3]]},"assertion":[{"value":"16 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"3"}}