{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T20:19:11Z","timestamp":1777666751082,"version":"3.51.4"},"reference-count":58,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>With the emergent evolution in DNA sequencing technology, a massive amount of genomic data is produced every day, mainly DNA sequences, craving for more storage and bandwidth. Unfortunately, managing, analyzing and specifically storing these large amounts of data become a major scientific challenge for bioinformatics. Therefore, to overcome these challenges, compression has become necessary. In this paper, we describe a new reference-free DNA compressor abbreviated as DNAC-SBE. DNAC-SBE is a lossless hybrid compressor that consists of three phases. First, starting from the largest base (Bi), the positions of each Bi are replaced with ones and the positions of other bases that have smaller frequencies than Bi are replaced with zeros. Second, to encode the generated streams, we propose a new single-block encoding scheme (SEB) based on the exploitation of the position of neighboring bits within the block using two different techniques. Finally, the proposed algorithm dynamically assigns the shorter length code to each block. Results show that DNAC-SBE outperforms state-of-the-art compressors and proves its efficiency in terms of special conditions imposed on compressed data, storage space and data transfer rate regardless of the file format or the size of the data.<\/jats:p>","DOI":"10.3390\/a13040099","type":"journal-article","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T03:23:06Z","timestamp":1587439386000},"page":"99","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A New Lossless DNA Compression Algorithm Based on A Single-Block Encoding Scheme"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6476-1568","authenticated-orcid":false,"given":"Deloula","family":"Mansouri","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan 430070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan 430070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdeldjalil","family":"Saidani","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan 430070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","article-title":"Initial sequencing and analysis of the human genome","volume":"409","author":"Lander","year":"2001","journal-title":"Nature"},{"key":"ref_2","unstructured":"Saada, B., and Zhang, J. (2015, January 21\u201323). Vertical DNA sequences compression algorithm based on hexadecimal representation. Proceedings of the World Congress on Engineering and Computer Science, San Francisco, CA, USA."},{"key":"ref_3","first-page":"732","article-title":"A comparative study and survey on existing DNA compression techniques","volume":"8","author":"Jahaan","year":"2017","journal-title":"Int. J. Adv. Res. Comput. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"350","DOI":"10.6026\/97320630005350","article-title":"DNABIT Compress\u2013Genome compression algorithm","volume":"5","author":"Rajarajeswari","year":"2011","journal-title":"Bioinformation"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/0306-4573(94)90014-0","article-title":"A new challenge for compression algorithms: Genetic sequences","volume":"30","author":"Grumbach","year":"1994","journal-title":"Information Process. Manag."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Majumder, A.B., and Gupta, S. (2018). CBSTD: A Cloud Based Symbol Table Driven DNA Compressions Algorithm. Industry Interactive Innovations in Science, Engineering and Technology, Springer.","DOI":"10.1007\/978-981-10-3953-9_45"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2527","DOI":"10.1093\/bioinformatics\/bts467","article-title":"DELIMINATE\u2014a fast and efficient method for loss-less compression of genomic sequences: Sequence analysis","volume":"28","author":"Mohammed","year":"2012","journal-title":"Bioinformatics"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1093\/bioinformatics\/btt594","article-title":"MFCompress: A compression tool for FASTA and multi-FASTA data","volume":"30","author":"Pinho","year":"2014","journal-title":"Bioinformatics"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.ygeno.2014.08.007","article-title":"SeqCompress: An algorithm for biological sequence compression","volume":"104","author":"Sardaraz","year":"2014","journal-title":"Genomics"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1093\/bioinformatics\/btr014","article-title":"Compression of DNA sequence reads in FASTQ format","volume":"27","author":"Deorowicz","year":"2011","journal-title":"Bioinformatics"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Bonfield, J.K., and Mahoney, M.V. (2013). Compression of FASTQ and SAM format sequencing data. PloS ONE, 8.","DOI":"10.1371\/journal.pone.0059190"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"690","DOI":"10.3844\/jcssp.2013.690.698","article-title":"A Deoxyribonucleic acid compression algorithm using auto-regression and swarm intelligence","volume":"9","author":"Aly","year":"2013","journal-title":"J. Comput. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Hosseini, M., Pratas, D., and Pinho, A.J. (2016). A survey on data compression methods for biological sequences. Information, 7.","DOI":"10.3390\/info7040056"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1038\/nmeth.4037","article-title":"Comparison of high-throughput sequencing data compression tools","volume":"13","author":"Bonfield","year":"2016","journal-title":"Nat. Methods"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Xing, Y., Li, G., Wang, Z., Feng, B., Song, Z., and Wu, C. (2017). GTZ: A fast compression and cloud transmission tool optimized for FASTQ files. BMC bioinformatics, 18.","DOI":"10.1186\/s12859-017-1973-5"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Behzadi, B., and Le Fessant, F. (2005, January 19\u201322). DNA compression challenge revisited: A dynamic programming approach. Proceedings of the Annual Symposium on Combinatorial Pattern Matching, Heidelberg, Jeju Island, Korea.","DOI":"10.1007\/11496656_17"},{"key":"ref_17","unstructured":"Kuruppu, S., Puglisi, S.J., and Zobel, J. Reference sequence construction for relative compression of genomes. Proceedings of the International Symposium on String Processing and Information Retrieval, Pisa, Italy."},{"key":"ref_18","unstructured":"(2019, June 29). GenBank and WGS Statistics (NCBI), Available online: https:\/\/www.ncbi.nlm.nih.gov\/genbank\/statistics\/."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"(2020, April 19). 1000 Genomes Project Consortium \u201ca map of human genome variation from population-scale sequencing\u201d, Nature 467 (2010) 1061\u20131073. Available online: www.1000genomes.org\/.","DOI":"10.1038\/nature09534"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1126\/science.1105136","article-title":"The ENCODE (ENCyclopedia of DNA elements) project","volume":"306","author":"Consortium","year":"2004","journal-title":"Science"},{"key":"ref_21","first-page":"35064","article-title":"An empirical study of DNA compression using dictionary methods and pattern matching in compressed sequences","volume":"10","author":"Keerthy","year":"2015","journal-title":"IJAER"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Arya, G.P., Bharti, R., Prasad, D., and Rana, S.S. (2016, January 29\u201330). An Improvement over direct coding technique to compress repeated & non-repeated nucleotide data. Proceedings of the 2016 International Conference on Computing, Communication and Automation (ICCCA), Noida, India.","DOI":"10.1109\/CCAA.2016.7813716"},{"key":"ref_23","first-page":"123","article-title":"Analysis and performance comparison of lossless compression techniques for text data","volume":"3","author":"Rastogi","year":"2014","journal-title":"Int. J. Eng. Comput. Res."},{"key":"ref_24","first-page":"1999","article-title":"A survey on different text data compression techniques","volume":"3","author":"Singh","year":"2012","journal-title":"Int. J. Sci. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1089\/cmb.2016.0151","article-title":"Toward a Better Compression for DNA Sequences Using Huffman Encoding","volume":"24","author":"Almarri","year":"2017","journal-title":"J. Comput. Biol."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Sharma, K., and Gupta, K. (2017, January 5\u20136). Lossless data compression techniques and their performance. Proceedings of the 2017 International Conference on Computing, Communication and Automation (ICCCA), Greater Noida, India.","DOI":"10.1109\/CCAA.2017.8229810"},{"key":"ref_27","unstructured":"(2019, June 29). Gzip. Available online: http:\/\/www.gzip.org\/."},{"key":"ref_28","unstructured":"(2019, June 29). Bzip. Available online: http:\/\/www.bzip.org\/."},{"key":"ref_29","first-page":"72","article-title":"DNA lossless compression algorithms","volume":"3","author":"Bakr","year":"2013","journal-title":"Am. J. Bioinformatics Res."},{"key":"ref_30","unstructured":"Grumbach, S., and Tahi, F. (April, January 30). Compression of DNA sequences. Proceedings of the Data Compression Confonference (DCC-93), Snowbird, UT, USA."},{"key":"ref_31","first-page":"51","article-title":"A compression algorithm for DNA sequences and its applications in genome comparison","volume":"10","author":"Chen","year":"1999","journal-title":"Genome Inf."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1696","DOI":"10.1093\/bioinformatics\/18.12.1696","article-title":"DNACompress: Fast and effective DNA sequence compression","volume":"18","author":"Chen","year":"2002","journal-title":"Bioinformatics"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1055709.1055711","article-title":"An Efficient Normalized Maximum Likelihood Algorithm for DNA Sequence Compression","volume":"23","author":"Korodi","year":"2005","journal-title":"ACM Trans. Inf. Syst."},{"key":"ref_34","first-page":"7685","article-title":"A Compression Algorithm for DNA Sequence Using Extended Operations","volume":"8","author":"Tan","year":"2012","journal-title":"J. Comput. Inf. Syst."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","article-title":"PatternHunter\u2014Faster and more sensitive homology search","volume":"18","author":"Ma","year":"2002","journal-title":"Bioinformatics"},{"key":"ref_36","unstructured":"Tabus, I., Korodi, G., and Rissanen, J. (2003, January 25\u201327). DNA sequence compression using the normalized maximum likelihood model for discrete regression. Proceedings of the Data Compression Conference (DCC \u201903), Snowbird, UT, USA."},{"key":"ref_37","unstructured":"Cao, M.D., Dix, T.I., Allison, L., and Mears, C. (2007, January 27\u201329). A simple statistical algorithm for biological sequence compression. Proceedings of the 2007 Data Compression Conference (DCC\u201907), Snowbird, UT, USA."},{"key":"ref_38","first-page":"39","article-title":"An efficient horizontal and vertical method for online DNA sequence compression","volume":"3","author":"Mishra","year":"2010","journal-title":"Int. J. Comput. Appl."},{"key":"ref_39","first-page":"181","article-title":"GENBIT COMPRESS TOOL (GBC): A java-based tool to compress DNA sequences and compute compression ratio (bits\/base) of genomes","volume":"2","author":"Rajeswari","year":"2010","journal-title":"Int. J. Comput. Sci. Inform. Tech."},{"key":"ref_40","first-page":"101","article-title":"Huffbit compress\u2014Algorithm to compress DNA sequences using extended binary trees","volume":"13","author":"Rajeswari","year":"2010","journal-title":"J. Theor. Appl. Inform. Tech."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Ouyang, J., Feng, P., and Kang, J. (2012, January 16\u201318). Fast compression of huge DNA sequence data. Proceedings of the 2012 5th International Conference on BioMedical Engineering and Informatics, Chongqing, China.","DOI":"10.1109\/BMEI.2012.6512909"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Li, P., Wang, S., Kim, J., Xiong, H., Ohno-Machado, L., and Jiang, X. (2013). DNA-COMPACT: DNA compression based on a pattern-aware contextual modeling technique. PLoS ONE, 8.","DOI":"10.1371\/journal.pone.0080377"},{"key":"ref_43","first-page":"73","article-title":"SBVRLDNAComp: An Effective DNA Sequence Compression Algorithm","volume":"5","author":"Roy","year":"2015","journal-title":"Int. J. Comput. Sci. Appl."},{"key":"ref_44","first-page":"323","article-title":"An Efficient Compression Algorithm for Forthcoming New Species","volume":"8","author":"Roy","year":"2015","journal-title":"Int. J. Hybrid Inf. Tech."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Eric, P.V., Gopalakrishnan, G., and Karunakaran, M. (2016). An optimal seed-based compression algorithm for DNA sequences. Adv. Bioinform.","DOI":"10.1155\/2016\/3528406"},{"key":"ref_46","first-page":"11","article-title":"Higher compression from burrows-wheeler transform for DNA sequence","volume":"173","author":"Rexline","year":"2017","journal-title":"Int. J. Comput. Appl."},{"key":"ref_47","first-page":"5610","article-title":"Lempel-Ziv-Welch Compression of DNA Sequence Data with Indexed Multiple Dictionaries","volume":"12","author":"Keerthy","year":"2017","journal-title":"Int. J. Appl. Eng. Res."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Habib, N., Ahmed, K., Jabin, I., and Rahman, M.M. (2018). Modified HuffBit Compress Algorithm\u2013An Application of R. J. Integr. Bioinform.","DOI":"10.1515\/jib-2017-0057"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1007\/s11277-018-5487-x","article-title":"Optimized Context Weighting for the Compression of the Un-repetitive Genome Sequence Fragment","volume":"103","author":"Chen","year":"2018","journal-title":"Wirel. Personal Commun."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Mansouri, D., and Yuan, X. (2018, January 13\u201316). One-Bit DNA Compression Algorithm. Proceedings of the International Conference on Neural Information Processing, Siam reap, Cambodia.","DOI":"10.1007\/978-3-030-04239-4_34"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Priyanka, M., and Goel, S. (2014, January 21\u201322). A compression algorithm for DNA that uses ASCII values. Proceedings of the 2014 IEEE International Advance Computing Conference, Gurgaon, India.","DOI":"10.1109\/IAdCC.2014.6779416"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1007\/s12038-012-9230-6","article-title":"BIND\u2013An algorithm for loss-less compression of nucleotide sequence data","volume":"37","author":"Bose","year":"2012","journal-title":"J. Biosci."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Jones, D., Ruzzo, W., Peng, X., and Katze, M. (2012). Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic Acids Res., 40.","DOI":"10.1093\/nar\/gks754"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.adhoc.2018.09.009","article-title":"A new lossless neighborhood indexing sequence (NIS) algorithm for data compression in wireless sensor networks","volume":"83","author":"Uthayakumar","year":"2019","journal-title":"Ad Hoc Netw."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Bakr, N.S., and Sharawi, A.A. (2017, January 27\u201328). Improve the compression of bacterial DNA sequence. Proceedings of the 2017 13th International Computer Engineering Conference (ICENCO), Cairo, Egypt.","DOI":"10.1109\/ICENCO.2017.8289802"},{"key":"ref_56","unstructured":"(2019, March 30). National Center for Biotechnology Information, Available online: https:\/\/www.ncbi.nlm.nih.gov\/."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"49","DOI":"10.5121\/ijfcst.2014.4605","article-title":"DNA data compression algorithms based on redundancy","volume":"4","author":"Roy","year":"2014","journal-title":"Int. J. Found. Comput. Sci. Technol."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1109\/18.382012","article-title":"The context tree weighting method: Basic properties","volume":"41","author":"Willems","year":"1995","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/4\/99\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:31:38Z","timestamp":1760362298000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/4\/99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":58,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,4]]}},"alternative-id":["a13040099"],"URL":"https:\/\/doi.org\/10.3390\/a13040099","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,20]]}}}