Developing an Approach to Compress Non-Repetitive Codecs of DNA Using a Novel NDCP: A Lossless Utility
DOI:
https://doi.org/10.53555/nncse.v3i4.425Keywords:
compression, coding, decoding, bio compress, Huffbit compress, dnabit compress, LSBD compressionAbstract
The transformation has been started with Information Theory in the field of Data compression. The outcome of data compression is a technological explosion in internet technology, now the continent is enjoying. Initially the spark of compression has been welded with Text (Lossless) compression and later it has been speeded to the allied areas like Geneti (DNA&mRna) and multimedia data compression (Lossless&Lossy). In 2004 the Human Genome project was deciphered. Can you imagine the human genome requires in an around of 30-35 GB for storage and maintenance. If at all if would have to maintain census data bases the infrastructure would requires substantially larger. So the remedy is compression of genetic sequences. Due to arrival of different DNA sequences the public genetic databases size growing like in an exponential manner. To limit it state of the art many DNA compression algorithms were strived into the compression era, but they work with common performance analysis of best, worst and avg cases based on repetitiveness of the DNA sequences. In case if DNA contains many non frequent fragments(non-codecs) the existing techniques may run in worst case. A new methodology is highly inevitable for non codec’s. In this work a Lossless novel utility Tool NDCP (Non-codecDNAcompression) was proposed to delimit the feasible compression ratios of existing compression techniques.
References
E Schrodinger. Cambridge University Press: Cambridge, UK, 1944.[PMID: 15985324]
R Giancarlo et al. A synopsis Bioinformatics 25:1575 (2009) [PMID:19251772]
EV Koonin. Bioinformatics 15: 265 (1999)
JC Wooley. J.Comput.Biol 6: 459 (1999) [PMID: 10582579]
CH Bennett et al. IEEE Trans.Inform.Theory 44: 4 (1998)
S Grumbach & F Tahi. Journal of Information Processing and Management 30(6): 875 (1994)
E Rivals et al. A guaranteed compression scheme for repetitive DNA sequences. LIFL, Lille I University, technical report IT-285 (1995)
X Chen et al. A compression algorithm for DNA sequences and its applications in Genome comparison. In Proceedings of the Fourth
Annual International Conference on Computational Molecular Biology, Tokyo, Japan, April 8-11, 2000. [PMID: 11072342]
TC Bell et al. Newyork:Prentice Hall (1990)
J Ziv & A Lempel. IEEE Trans. Inf. Theory 23: 337 (1977)
A Grumbach & F Tahi. In Proceedings of the IEEE Data [12]
DNA compression is challenge is revisited Beshad Behajadi
Allam AppaRao.In proceedings of the Bio medical Informatics Journal [2011].DNABIT compress-compression of DNA sequences
Allam AppaRao.In proceedings of the JATIT journal computationalf Biology and Bio Informatics:[2009].HuffBit compress-compression of DNA using extended binary trees.
Allam AppaRao.In proceedings of the JATIT journal computational Biology and Bio Informatics:[2011].Genbit compress-compression of DNA sequences.
Edries Abdelhadi In proceedings of the IJCA journal of computer applications[2010]: An efficient horizontal and vertical method for
online DNA sequance compression.
Srinivasa K G,Jagadish M, Venugopal K R and L M Patnaik “Efficient compression of non repetitive DNA sequances using Dynamic
programming “ pages 569-574 IEEE 2006.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Terms & Condition
Submission -
Author can submit the manuscript through our online submission process or email us at the designated email id in contact details.
The other mode of submission not accepted than online and email.
Before submission please read the submission guidelines.
NN Publication accepts only article submitted in pdf/doc/docx/rtf file format. Another format except given file formats will no be considered .
Author will be responsible for the error mistakes in the submission files. The minor changes can be done without any cost after publication. But for major changes NN Publication may charges you the editing charges.
Publication (Online) -
The online publication is scheduled on last date of every month, but it can be delayed by 24 to 48 hours due to editorial process if huge number of articles comes to publish in single issue.
Automatic notificatation email will be sent to the all users on publication of an issue, so its author’s duty to check their email inbox or SPAM folder to get this notification.
After publication of article author can not withdraw their article.
If editor’s found any issue after publication of article then the NN Publication have the authority to remove the article from online website.
No refund will be provided after online publication of article.
Publication (Print) -
The print copy publication are sent as per the author’s request after 2 weeks of online publication of that issue.
NN Publication will ship the article by India Post and provide the consignment number on dispatch of print copy.
NN Publication follows all the guidelines of delivery provided by IndiaPost and hence not responsible for delay in delivery due to any kind of reasons.
Refund of hard copy will not be provided after dispatch or print of the journal.
NN Publication will be responsible for raise a complain if there is any issue occurs in delivery, but still will not be responsible for providing the refund.
NN Publication will be responsible to resend the print copy only and only if the print copy is lost or print copy is damaged in delivery / or there is delay more than 6 months.
According to India Post the delivery should be completed with in 1-3 weeks after dispatch of articles.
Privacy Policy-
NN Publicationl uses the email ids of authors and editors and readers for sending editorial or publication notification only, we do not reveal or sell the email ids to any other website or company.
