{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T20:34:42Z","timestamp":1722803682434},"reference-count":24,"publisher":"Walter de Gruyter GmbH","issue":"3","license":[{"start":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T00:00:00Z","timestamp":1519257600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9,25]]},"abstract":"Abstract<\/jats:title>\n The databases of genomic sequences are growing at an explicative rate because of the increasing growth of living organisms. Compressing deoxyribonucleic acid (DNA) sequences is a momentous task as the databases are getting closest to its threshold. Various compression algorithms are developed for DNA sequence compression. An efficient DNA compression algorithm that works on both repetitive and non-repetitive sequences known as \u201cHuffBit Compress\u201d is based on the concept of Extended Binary Tree. In this paper, here is proposed and developed a modified version of \u201cHuffBit Compress\u201d algorithm to compress and decompress DNA sequences using the R language which will always give the Best Case of the compression ratio but it uses extra 6 bits to compress than best case of \u201cHuffBit Compress\u201d algorithm and can be named as the \u201cModified HuffBit Compress Algorithm\u201d. The algorithm makes an extended binary tree based on the Huffman Codes and the maximum occurring bases (A, C, G, T). Experimenting with 6 sequences the proposed algorithm gives approximately 16.18\u2009% improvement in compression ration over the \u201cHuffBit Compress\u201d algorithm and 11.12\u2009% improvement in compression ration over the \u201c2-Bits Encoding Method\u201d.<\/jats:p>","DOI":"10.1515\/jib-2017-0057","type":"journal-article","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T10:49:09Z","timestamp":1519728549000},"source":"Crossref","is-referenced-by-count":5,"title":["Modified HuffBit Compress Algorithm \u2013 An Application of R"],"prefix":"10.1515","volume":"15","author":[{"given":"Nahida","family":"Habib","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering (CSE) , Mawlana Bhashani Science and Technology University (MBSTU) , Santosh , Tangail 1902 , Bangladesh"}]},{"given":"Kawsar","family":"Ahmed","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Technology (ICT) , Mawlana Bhashani Science and Technology University (MBSTU) , Tangail , Bangladesh"}]},{"given":"Iffat","family":"Jabin","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering (CSE) , Mawlana Bhashani Science and Technology University (MBSTU) , Tangail , Bangladesh"}]},{"given":"Mohammad Motiur","family":"Rahman","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering (CSE) , Mawlana Bhashani Science and Technology University (MBSTU) , Tangail , Bangladesh"}]}],"member":"374","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"key":"2023033119204006454_j_jib-2017-0057_ref_001_w2aab3b7b3b1b6b1ab1b8b1Aa","unstructured":"PROGRAMIZ. https:\/\/www.programiz.com\/r-programming. Accessed Sepetember 19, 2017."},{"key":"2023033119204006454_j_jib-2017-0057_ref_002_w2aab3b7b3b1b6b1ab1b8b2Aa","unstructured":"Vance A. Data analysts captivated by R\u2019s Power. NY Times, 2009. URL http:\/\/www.nytimes.com\/2009\/01\/07\/technology\/business-computing\/07program.html?_r=1."},{"key":"2023033119204006454_j_jib-2017-0057_ref_003_w2aab3b7b3b1b6b1ab1b8b3Aa","unstructured":"Timothy Prickett Morgan. Open source R in commercial revolution. The Register, 2010. URL http:\/\/www.theregister.co.uk\/2010\/05\/06\/revolution_commercial_r\/."},{"key":"2023033119204006454_j_jib-2017-0057_ref_004_w2aab3b7b3b1b6b1ab1b8b4Aa","unstructured":"Genetics Home Reference. https:\/\/ghr.nlm.nih.gov\/primer\/hgp\/genome. Accessed March 15, 2017."},{"key":"2023033119204006454_j_jib-2017-0057_ref_005_w2aab3b7b3b1b6b1ab1b8b5Aa","unstructured":"Bharti RK, Singh RK. A biological sequence compression based on look up table (LUT) using complementary palindrome of fixed size. Int J Comput Appl. 2011;35:0975\u20138887."},{"key":"2023033119204006454_j_jib-2017-0057_ref_006_w2aab3b7b3b1b6b1ab1b8b6Aa","doi-asserted-by":"crossref","unstructured":"Grumbach S, Tahi F. A new challenge for compression algorithms: genetic sequences. Inf Process Manage 1994;30:875\u201386.10.1016\/0306-4573(94)90014-0","DOI":"10.1016\/0306-4573(94)90014-0"},{"key":"2023033119204006454_j_jib-2017-0057_ref_007_w2aab3b7b3b1b6b1ab1b8b7Aa","unstructured":"Genomatix. https:\/\/www.genomatix.de\/online_help\/help\/sequence_formats.html. Accessed March 15, 2017."},{"key":"2023033119204006454_j_jib-2017-0057_ref_008_w2aab3b7b3b1b6b1ab1b8b8Aa","unstructured":"GenBank and WGS Statistics (NCBI). https:\/\/www.ncbi.nlm.nih.gov\/genbank\/statistics\/. Accessed March 15, 2017."},{"key":"2023033119204006454_j_jib-2017-0057_ref_009_w2aab3b7b3b1b6b1ab1b8b9Aa","doi-asserted-by":"crossref","unstructured":"Koonin EV. The emerging paradigm and open problems in comparative genomics. Bioinformatics 1999;15:265\u20136.1043822910.1093\/bioinformatics\/15.4.265","DOI":"10.1093\/bioinformatics\/15.4.265"},{"key":"2023033119204006454_j_jib-2017-0057_ref_010_w2aab3b7b3b1b6b1ab1b8c10Aa","doi-asserted-by":"crossref","unstructured":"Wooley JC. Trends in computational biology: a summary based on a RECOMB plenary lecture, 1999. J Comput Biol. 2004;6:459\u2013474.","DOI":"10.1089\/106652799318391"},{"key":"2023033119204006454_j_jib-2017-0057_ref_011_w2aab3b7b3b1b6b1ab1b8c11Aa","doi-asserted-by":"crossref","unstructured":"Bennett CH, Gacs P, Li M, Vitanyi PMB, Zurek WH. Information distance. IEEE Trans Inf Theory. 1998;44:4.","DOI":"10.1109\/18.681318"},{"key":"2023033119204006454_j_jib-2017-0057_ref_012_w2aab3b7b3b1b6b1ab1b8c12Aa","unstructured":"Rivals E, Delahaye J-P, Dauchet M, Delgrange O. A guaranteed compression scheme for repetitive DNA sequences. LIFL I University, technical report 1995; IT-285."},{"key":"2023033119204006454_j_jib-2017-0057_ref_013_w2aab3b7b3b1b6b1ab1b8c13Aa","doi-asserted-by":"crossref","unstructured":"Rajarajeswari P, Apparao A. DNABIT compress \u2013 genome compression algorithm. Bioinformation 2011;5:350\u201360.10.6026\/9732063000535021383923","DOI":"10.6026\/97320630005350"},{"key":"2023033119204006454_j_jib-2017-0057_ref_014_w2aab3b7b3b1b6b1ab1b8c14Aa","unstructured":"Grumbach S, Tahi F. Compression of DNA sequences. In: IEEE Symposium on the Data Compression Conference, DCC-93; Snowbird, UT, 1993:340\u201350."},{"key":"2023033119204006454_j_jib-2017-0057_ref_015_w2aab3b7b3b1b6b1ab1b8c15Aa","doi-asserted-by":"crossref","unstructured":"Ziv J, Lempel A. A universal algorithm for sequential data compression. IEEE Trans Inf Theory. 1977;IT-23:337.","DOI":"10.1109\/TIT.1977.1055714"},{"key":"2023033119204006454_j_jib-2017-0057_ref_016_w2aab3b7b3b1b6b1ab1b8c16Aa","doi-asserted-by":"crossref","unstructured":"ZIV J. Coding theorems for individual sequences. IEEE Trans Inf Theory. 1978;IT-24. [PMID: 20157474].","DOI":"10.1109\/TIT.1978.1055911"},{"key":"2023033119204006454_j_jib-2017-0057_ref_017_w2aab3b7b3b1b6b1ab1b8c17Aa","unstructured":"Bakr NS, Sharawi AA. DNA lossless compression algorithms: review. Am J Bioinform Res 2013;3:72\u201381."},{"key":"2023033119204006454_j_jib-2017-0057_ref_018_w2aab3b7b3b1b6b1ab1b8c18Aa","unstructured":"Bharti RK, Harbola D. State of the art: DNA compression algorithms. IJARCSSE 2013;3:397."},{"key":"2023033119204006454_j_jib-2017-0057_ref_019_w2aab3b7b3b1b6b1ab1b8c19Aa","unstructured":"Rivals E, Dauchet M. Fast discerning repeats in DNA sequences with a compression algorithm. In: The 8th Workshop on Genome and Informatics, (GIW97) 1997; 8: 215\u201326."},{"key":"2023033119204006454_j_jib-2017-0057_ref_020_w2aab3b7b3b1b6b1ab1b8c20Aa","doi-asserted-by":"crossref","unstructured":"Chen X, Li M, Ma B, Tromp J. DNACompress: fast and effective DNA sequence compression. Bioinformatics 2002;18:1696\u20138.10.1093\/bioinformatics\/18.12.169612490460","DOI":"10.1093\/bioinformatics\/18.12.1696"},{"key":"2023033119204006454_j_jib-2017-0057_ref_021_w2aab3b7b3b1b6b1ab1b8c21Aa","doi-asserted-by":"crossref","unstructured":"Ma B, Tromp J, Li M. PatternHunter \u2013 faster and more sensitive homology search. Bioinformatics 2002;18:440\u20135.1193474310.1093\/bioinformatics\/18.3.440","DOI":"10.1093\/bioinformatics\/18.3.440"},{"key":"2023033119204006454_j_jib-2017-0057_ref_022_w2aab3b7b3b1b6b1ab1b8c22Aa","unstructured":"Raja Rajeswari P, Apparao A, Kiran Kumar R. HUFFBIT COMPRESS \u2013 algorithm to compress DNA sequences using extended binary trees. J Theor Appl Inf Technol. 2010;13:101\u20136."},{"key":"2023033119204006454_j_jib-2017-0057_ref_023_w2aab3b7b3b1b6b1ab1b8c23Aa","unstructured":"Ghoshdastider U, Saha B. GenomeCompress: a novel algorithm for DNA compression, 2007."},{"key":"2023033119204006454_j_jib-2017-0057_ref_024_w2aab3b7b3b1b6b1ab1b8c24Aa","unstructured":"Complexity. http:\/\/www.dcs.gla.ac.uk\/~pat\/52233\/complexity.html. Accessed August 17, 2017."}],"container-title":["Journal of Integrative Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/jib.2018.15.issue-3\/jib-2017-0057\/jib-2017-0057.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jib-2017-0057\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jib-2017-0057\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T06:21:58Z","timestamp":1680330118000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jib-2017-0057\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,22]]},"references-count":24,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,8,7]]},"published-print":{"date-parts":[[2018,9,25]]}},"alternative-id":["10.1515\/jib-2017-0057"],"URL":"https:\/\/doi.org\/10.1515\/jib-2017-0057","relation":{},"ISSN":["1613-4516"],"issn-type":[{"value":"1613-4516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,22]]}}}