International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 35 - Issue 11 |
Published: December 2011 |
Authors: R. K. Bharti, Prof. R. K. Singh |
![]() |
R. K. Bharti, Prof. R. K. Singh . A Biological sequence Compression based on Look up Table (LUT) using Complementary Palindrome of Fixed size. International Journal of Computer Applications. 35, 11 (December 2011), 55-58. DOI=10.5120/4451-6225
@article{ 10.5120/4451-6225, author = { R. K. Bharti,Prof. R. K. Singh }, title = { A Biological sequence Compression based on Look up Table (LUT) using Complementary Palindrome of Fixed size }, journal = { International Journal of Computer Applications }, year = { 2011 }, volume = { 35 }, number = { 11 }, pages = { 55-58 }, doi = { 10.5120/4451-6225 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2011 %A R. K. Bharti %A Prof. R. K. Singh %T A Biological sequence Compression based on Look up Table (LUT) using Complementary Palindrome of Fixed size%T %J International Journal of Computer Applications %V 35 %N 11 %P 55-58 %R 10.5120/4451-6225 %I Foundation of Computer Science (FCS), NY, USA
Data Storage costs have an appreciable proportion of total cost in the creation and analysis of DNA sequences. In particular, the increase in the DNA sequences is highly remarkable with compare to increase in the disk storage capacity. General text compression algorithms do not utilize the specific characteristics of DNA sequences. In this paper we have proposed a compression algorithm based on cross complementary properties of DNA sequences. This technique helps for comparing DNA sequences and also to identify similar subsequences which may lead to the identification of structure as well as similar function.