Home   >   CSC-OpenAccess Library   >    Manuscript Information
A Biological Sequence Compression Based on cross chromosomal similarities using Variable length LUT
Rajendra Kumar Bharti, Archana Verma, R.K. Singh
Pages - 217 - 223     |    Revised - 31-01-2011     |    Published - 08-02-2011
Volume - 4   Issue - 6    |    Publication Date - February  Table of Contents
Biological sequences, chromosome, cross chromosomal similarity, compression gain, prediction
While modern hardware can provide vast amounts of inexpensive storage for biological databases, the compression of Biological sequences is still of paramount importance in order to facilitate fast search and retrieval operations through a reduction in disk traffic. This issue becomes even more important in light of the recent increase of very large data sets, such as meta genomes. The present Biological sequence compression algorithms work by finding similar repeated regions within the Biological sequence and then encode these repeated regions together for compression. The previous research on chromosome sequence similarity reveals that the length of similar repeated regions within one chromosome is about 4.5% of the total sequence length. The compression gain is often not high because of these short lengths of repeated regions. It is well recognized that similarities exist among different regions of chromosome sequences. This implies that similar repeated sequences are found among different regions of chromosome sequences. Here, we apply cross-chromosomal similarity for a Biological sequence compression. The length and location of similar repeated regions among the different Biological sequences are studied. It is found that the average percentage of similar subsequences found between two chromosome sequences is about 10% in which 8% comes from cross-chromosomal prediction and 2% from self-chromosomal prediction. The percentage of similar subsequences is about 18% in which only 1.2% comes from self-chromosomal prediction while the rest is from cross-chromosomal prediction among the different Biological sequences studied. This suggests the significance of cross-chromosomal similarities in addition to self-chromosomal similarities in the Biological sequence compression. An additional 23% of storage space could be reduced on average using self-chromosomal and cross-chromosomal predictions in compressing the different Biological sequences.
CITED BY (6)  
1 Wandelt, S., Bux, M., & Leser, U. (2014). Trends in genome compression. Current Bioinformatics, 9(3), 315-326.
2 Wandelt, S., Rheinländer, A., Bux, M., Thalheim, L., Haldemann, B., & Leser, U. (2012). Data management challenges in next generation sequencing. Datenbank-Spektrum, 12(3), 161-171.
3 Wandelt, S., & Leser, U. (2012). String Searching in Referentially Compressed Genomes. In KDIR (pp. 95-102).
4 Roy, S., Khatua, S., Roy, S., & Bandyopadhyay, S. K. (2012). An Efficient Biological Sequence Compression Technique Using LUT and Repeat in the Sequence. IOSR Journal of Computer Engineering (IOSRJCE), 6(1), 42-50.
5 Bharti, R. K., & Singh, R. K. (2011). A Biological sequence Compression based on Look up Table(LUT) using Complementary Palindrome of Fixed size. International Journal of Computer Applications, 35(11).
6 Bharti, K. B., & Singh, R. K. (2011). Biological sequence compression based on complementary palindrome using variable length Look Up Table (LUT). Int. J. Res. Rev. Applied Sci, 9, 461-463.
1 Google Scholar 
2 Academic Journals Database 
3 CiteSeerX 
4 refSeek 
5 iSEEK 
6 ResearchGATE 
7 Libsearch 
8 Bielefeld Academic Search Engine (BASE) 
9 Scribd 
10 WorldCat 
11 SlideShare 
12 PdfSR 
Ateet Mehta , 2010, et al., “ DNA Compression using Hash Based Data Structure”, IJIT&KM, Vol2 No.2, pp. 383-386.
B.A., 2005, “ Genetics: A comceptual approach.” Freeman, PP 311.
Choi Ping Paula Wu, 2008, et al., “ Cross chromosomal similarity for DNA sequence compression”, Bioinformatics 2(9): 412-416.
Gregory Vey, 2009, “Differential direct coding: a compression algorithm for nucleotide sequence data”, Database, doi: 10.1093/database/bap013.
J. Ziv and A., 1977, et al, “A universal algorithm for sequential data compression,” IEEE Transactions on Information Theory, vol. IT-23.
K.N. Mishra, 2010, “ An efficient Horizontal and Vertical Method for Online DNA sequence Compression”, IJCA(0975-8887), Vol3, PP 39-45.
P. raja Rajeswari, 2010, et al., “ GENBIT Compress- Algorithm for repetitive and non repetitive DNA sequences”, JTAIT, PP 25-29.
Pavol Hanus, 2010, et al., “Compression of whole Genome Alignments”, IEE Transactions of Information Theory, vol.56, No.2Doi: 10.1109/TIT.2009.2037052.
R. Curnow, 1989, et al. “Statistical analysis of deoxyribonucleic acid sequence data-a review,” J Royal Statistical Soc., vol. 152, pp. 199-220.
Sheng Bao, 2005, et al. “A DNA Sequence Compression Algorithm Based on LUT and LZ77”, IEEE International Symposium on Signal Processing and Information Technology.
U. Ghoshdastider, 2005, et al., “GenomeCompress: A Novel Algorithm for DNA Compression”, ISSN 0973-6824.
Voet & Voet, Biochemistry, 3rd Edition, 2004.
X. Chen, 2002, et al., “Dnacompress:fast and effective dna sequence compression,” Bioinformatics, vol. 18,.
Xin Chen, 2002, et al.,” DNA Compress: fast and effective DNA sequence Compression” BIOINFORMATICS APPLICATIONS NOTE, Vol. 18 no. 12, Pages 1696–1698.
Mr. Rajendra Kumar Bharti
B.C.T. Kumaon Engineering College - India
Mr. Archana Verma
Professor R.K. Singh
- India