We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
An Efficient Restoration Method for the Faint Dot Matrix Images

Ao Zhu Peng Cao
Random Articles
Reseach Article

A Biological sequence Compression based on Look up Table (LUT) using Complementary Palindrome of Fixed size

by R. K. Bharti, Prof. R. K. Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 35 - Number 11
Year of Publication: 2011
Authors: R. K. Bharti, Prof. R. K. Singh
10.5120/4451-6225

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 },
issue_date = { December 2011 },
volume = { 35 },
number = { 11 },
month = { December },
year = { 2011 },
issn = { 0975-8887 },
pages = { 55-58 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume35/number11/4451-6225/ },
doi = { 10.5120/4451-6225 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:21:45.860844+05:30
%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
%J International Journal of Computer Applications
%@ 0975-8887
%V 35
%N 11
%P 55-58
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Ateet Mehta , 2010, et al., “ DNA Compression using Hash Based Data Structure”, IJIT&KM, Vol2 No.2, pp. 383-386.
  2. B.A., 2005, “ Genetics: A comceptual approach.” Freeman, PP 311.
  3. Choi Ping Paula Wu, 2008, et al., “ Cross chromosomal similarity for DNA sequence compression”, Bioinformatics 2(9): 412-416.
  4. Gregory Vey,2009, “Differential direct coding: a compression algorithm for nucleotide sequence data”, Database, doi: 10.1093/database/bap013.
  5. J. Ziv and A.1977, et al., “A universal algorithm for sequential data compression,” IEEE Transactions on Information Theory, vol. IT-23.
  6. K.N. Mishra,2010, “ An efficient Horizontal and Vertical Method for Online DNA sequence Compression”, IJCA(0975-8887), Vol3, PP 39-45.
  7. P. raja Rajeswari, 2010, et al., “ GENBIT Compress- Algorithm for repetitive and non repetitive DNA sequences”, JTAIT, PP 25-29.
  8. Pavol Hanus, 2010, et al., “Compression of whole Genome Alignments”, IEE Transactions of Information Theory, vol.56, No.2Doi: 10.1109/TIT.2009.2037052.
  9. R.K.Bharti,2011, et al., ”Biological sequence Compression Based on Cross chromosomal properties Using variable length LUT”, CSC Journal, Vol 4 Issue 6, PP:217-223.
  10. R.K.Bharti,2011, et al, “Biological sequence Compression Based on properties unique and repeated repeats Using variable length LUT” CiiT journal, Vol 3 Issue, 4, PP: 158 – 162..
  11. R.K.Bharti,2011, et al, “A Biological sequence compression Based on Approximate repeat Using Variable length LUT” International Journal of Advances in Science and Technology, Vol. 3, No.3,PP:71-75.
  12. R. Curnow, 1989, et al. “Statistical analysis of deoxyribonucleic acid sequence data-a review,” J Royal Statistical Soc., vol. 152, pp. 199-220.
  13. Sheng Bao, 2005, et al. “A DNA Sequence Compression Algorithm Based on LUT and LZ77”.
  14. U. Ghoshdastider,2005, et al., “GenomeCompress: A Novel Algorithm for DNA Compression”, ISSN 0973-6824.
  15. Xin Chen, 2002, et al.,” DNA Compress: fast and effective DNA sequence Compression” BIOINFORMATICS APPLICATIONS NOTE, Vol. 18 no. 12, Pages 1696–1698.
  16. X. Chen, 2002, et al., “Dnacompress:fast and effective dna sequence compression,” Bioinformatics, vol. 18.
Index Terms

Computer Science
Information Sciences

Keywords

DNA Sequences Text Compression Cross Chromosomal similarity complementary palindrome LUT compression

Powered by PhDFocusTM