Genomic Sequence Data Compression using Lempel Ziv Welch Algorithm with Indexed Multiple Dictionary

  • S. K
  • et al.
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the advancement in technology and development of High Throughput System (HTS), the amount of genomic data generated per day per laboratory across the globe is surpassing the Moore’s law. The huge amount of data generated is of concern to the biologists with respect to their storage as well as transmission across different locations for further analysis. Compression of the genomic data is the wise option to overcome the problems arising from the data deluge. This paper discusses various algorithms that exists for compression of genomic data as well as a few general purpose algorithms and proposes a LZW-based compression algorithm that uses indexed multiple dictionaries for compression. The proposed method exhibits an average compression ratio of 0.41 bits per base and an average compression time of 6.45 secs for a DNA sequence of an average size 105.9 KB.

Cite

CITATION STYLE

APA

S., K. A., & Priya, S. M. (2019). Genomic Sequence Data Compression using Lempel Ziv Welch Algorithm with Indexed Multiple Dictionary. International Journal of Engineering and Advanced Technology, 9(2), 541–547. https://doi.org/10.35940/ijeat.b3278.129219

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free