Article thumbnail

A Novel DNAZIP Tool for Zipping of Genome Sequences by Linear Bounded Data Structure

By Hari Prasad V

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

Topics: Encode, Decode, push down stack, Huff bit, GenBit, , DNASC, DNABIT, LSBD compression
Year: 2016
OAI identifier: oai:CiteSeerX.psu:10.1.1.736.2883
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://research.ijcaonline.org... (external link)
  • http://research.ijcaonline.org... (external link)
  • http://citeseerx.ist.psu.edu/v... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles