Validation of Encrypted DNA Sequences:an Algorithmic SDV Approach

V.Hari Prasad*
Professor, Department of Computer Science and Engineering, Government Polytechnic College, Andra Pradesh, India.
Periodicity:September - November'2014
DOI : https://doi.org/10.26634/jcom.2.3.3311

Abstract

While technology keeps growing, the world keeps shrinking, and this transformation is possible through compression. Earlier, computers occupied a room, now people are conveniently carrying in their hand. These massive developments are possible through compression in internet and other real time applications. Many English text compression algorithms fail to compress genetic sequences due to “the specialty of encoded text in genetic sequences”. In addition to that in text compression very rare code word repetitions occur, where as, in DNA (Deoxyribo Nucleic Acid) the repetitions of codewords are more and more. So there may be a possibility that the compression ratio and gain will be more in DNA (Genomic) sequences. This assumption makes true when the Human genome project is deciphered. Many State-of-theart compression algorithms are existing in connection with DNA sequences. Existing techniques are focused on compression rate, compress gain, time and space as metrics, and questions arise such that whether encoded and decoded sequence is valid or not?. The resultant answer is validation. Validation is highly required for resultant sequence. In this paper, the proposed novel methodology SDV (Shift Distance Validation) an algorithmic approach is employed, to test the validity of decompressed sequences which is more important in security applications.

Keywords

Compression, Decompression, DNA, Hamming Distance, Pattern Matching.

How to Cite this Article?

Prasad, V.H. (2014). Validation of Encrypted DNA Sequences: An Algorithmic SDV Approach. i-manager’s Journal on Computer Science, 2(3), 6-10. https://doi.org/10.26634/jcom.2.3.3311

References

[1]. E Schrodinger. (1944). Cambridge University Press: Cambridge, UK, [PMID: 15985324]
[2]. Raffaele Giancarlo, Davide Scaturro and Filippo Utro,(2009).“Tex tual Data Compression in Computational Biology: a Synopsis,” Oxford University Press, Vol.25(13), pp.1575–1586.
[3]. EV Koonin, (1999). “Drug Targets in Microbial Genomes,” Current Opinion in Biotechnology, Vol.10 (6), pp.571-578.
[4]. JC Wooley, (1999). “Bioinformatics,” Journal on Computations, Vol.6 (3 & 4), pp.459-474.
[5]. C H Bennett, M Li, P M B Vitanyi, W H Zurek, (1998). “Information Distance,” IEEE Transactions on Information Theory, Vol.44(4), pp.1407-1423.
[6]. S Grumbach and F Tahi, (1994). “A New Challenge for Compression Algorithms: Genetic Sequences,” Journal of Information Processing and Management, Vol.30(6), pp. 875-886.
[7]. Eric Rivals, Jean-paul Delahaye, Max Dauchet, Olivier Delgrange, (1995). “A Guaranteed Compression Scheme for Repetitive DNA Sequences,” Technical Report IT-285, Lille I University (LIFL), pp.453.
[8]. X Chen, Sam Kwong, Ming Li, (2000). “A compression Algorithm for DNA Sequences and its Applications in Genome comparison,” In Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, pp.107.
[9]. TC Bell, J.G. Cleary, I.H.Witten, (1990). “Text Compression,” Prentice Hall, Newyork.
[10]. J Ziv & A Lempel, (1977). “A Universal Algorithm for Sequential Data Compression,” IEEE Transactions on Information Theory ,Vol.23,pp.337-343.
[11]. A Grumbach & F Tahi, (1993). “Compression of DNA Sequences,” In Proceedings of the IEEE Data 12 DNA Compression is Challenge Revisited-Beshad Behajadi, pp.340-350.
[12]. X Chen et al, (2000). “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, pp.15-24.
[13]. X Chen et al, (2002). “DNA Compress: Fast and Effective DNA Sequence Compression,” Bioinformatics Applications Note, Vol.18(12), pp.1696- 1698.
[14]. Kamta Nath Mishra, (2010). “An Efficient Horizontal and Vertical Method for Online DNA Sequence Compression,” In International Journal of Computer Applications, Vol.3(1), pp.39-46.
[15]. Pothuraju Rajarajeswari, Allam Appa Rao, (2011). “DNA BIT Compress – Genome compression algorithm”, Bioinformation, Vol.5(8), pp.350-360.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.