The week's pick
Random Articles
Reseach Article
A Novel DNAZIP Tool for Zipping of Genome Sequences by Linear Bounded Data Structure
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 46 - Number 2 |
| Year of Publication: 2012 |
| Authors: Hari Prasad .v, P. V. Kumar |
10.5120/6879-9182
|
Hari Prasad .v, P. V. Kumar . A Novel DNAZIP Tool for Zipping of Genome Sequences by Linear Bounded Data Structure. International Journal of Computer Applications. 46, 2 ( May 2012), 17-23. DOI=10.5120/6879-9182
Abstract
In Of late due to excessive accumulation of genetic sequences need of vacuuming plays predominant role in database when it reaches to its threshold. Vacuuming refers to data should not be deleted physically but it is superseded. The achieved data can be stored in secondary storage, we can access it by writing temporal quarries but applying temporal quarries to genome data is spiky process. Hence need of zipping arises for processing, storing and managing data in a centralized and distributed environment. The genome is living organism encoded in DNA and RNA . Many existing algorithms had a eye on genome compression but they are having their own tradeoff in their compression ratios. DNA may be repetitive and non repetitive in nature based on this property earlier algorithms performed and achieved bountiful results. In this paper, we describing a novel DNASCP tool based on linear bounded array data structure for easy preservation of lossless property and secured transmission of data in a client server environment. . Our tool will work on both repetitive and non repetitive sequences and computed results are on par with existing techniques. Definitely our one will becomes an invaluable tool in bio informatics era.
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
- X Chen et al. In Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, Tokyo, Japan, April 8-11, 2000.
- X Chen et al. Bioinformatics 18: 1696 (2002) [PMID: 12490460]
- An Efficient Horizontal and Vertical Method for Online DNA Sequence Compression in IJCA proceedings 2010 vol. 3,Issue 1 June 2010.
- Allam AppaRao. In proceedings of the Bio medical Informatics Journal
- . DNABIT compress-compression of DNA sequences
- Loss less segment based compression in IEEE confernece proceedings in ICECT-2011 kanyakumari,India.
- 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
- National Center for Biotechnology Information, Entrez Nucleotide Query, http://www. ncbi. nlm. nih. gov/htbin-post/Entrez/query?db=n s.
- Allam AppaRao in proceedings of the JATIT journal computational biology and Bio informatics:
- . Huffbit compression of DNA sequances
- Allam AppaRao in proceedings of the JATIT journal of computational Biology
- ,Genbit compress fro DNA sequances.
Index Terms
Keywords