Design of Unique Auto generated DNA Digital Dictionary using permutations of finite structures for Genome Sequence Compression

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

Abstract Due to the population growth of the organisms at an unpredicted rate, biological sequence data generation keeps on increasing day by day. Rapid technological development leads to the improved version of sequencing machines which makes it to generate massive amount of Genome sequences much easier than before. Biologists engaged in large Genome projects sequenced huge amount of Genome sequences for different organisms and stored in the biological databases everyday which results in data storage crisis in the field of Bioinformatics. Handling of huge volume of Genome data creates a challenge in storage, analysis and transmission. Compression of Genome sequence data is essential to address this challenge. In this paper, a simple but effective compression algorithm for Genome sequences namely DNA Digital Dictionary (D3) is proposed using an efficient encoding scheme for better compression. The proposed algorithm is demonstrated using Genome sequences of different organisms. Experimental results of the proposed algorithm are compared with the state of art tools and recent existing algorithms. It is observed that the proposed algorithm “D3” outperforms the existing methods in terms of compression ratio and compression time. The average compression ratio for the proposed technique is 4:1 and the time complexity is O(n).

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0