Network Coding For Data Compression In Genomic Sequencing

The exponential growth of next-generation sequencing technologies has resulted in a massive influx of genomic data, posing significant challenges in storage, transmission, and processing. Conventional compression methods, such as gzip and bzip2, are not optimized for the unique structural patterns and redundancies of genomic sequences, leading to suboptimal performance. Addressing this gap, our research introduces a novel data compression framework that leverages network coding principles to enhance efficiency, scalability, and reliability. Network coding, widely used in communication systems, is adapted here to process and compress genomic data by employing finite field arithmetic and redundancy-aware encoding techniques. Our method achieves a compression ratio of up to 50% while maintaining a data integrity level of 99.99%, as validated through extensive mathematical analysis and experimental testing on diverse genomic datasets. Furthermore, the framework demonstrates linear scalability and robust error resilience, making it particularly suited for large-scale applications in clinical genomics and research. By bridging the gap between traditional compression algorithms and the growing demands of modern genomic data, this study lays the groundwork for more efficient and reliable data management solutions in bioinformatics.

Authors

Institutions

Publication Details

Published
2025-03-07
DOI
https://doi.org/10.1109/icdt63985.2025.10986470
Citations
1
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Network Coding For Data Compression In Genomic Sequencing

Abhimanyu Sharma, Sultan Alam, S S Agarwal
1 citations
Algorithms and Data Compression
2.48
article

Network Coding For Data Compression In Genomic Sequencing

Abhimanyu Sharma, Sultan Alam, S S Agarwal
article en
1 citations

Abstract

The exponential growth of next-generation sequencing technologies has resulted in a massive influx of genomic data, posing significant challenges in storage, transmission, and processing. Conventional compression methods, such as gzip and bzip2, are not optimized for the unique structural patterns and redundancies of genomic sequences, leading to suboptimal performance. Addressing this gap, our research introduces a novel data compression framework that leverages network coding principles to enhance efficiency, scalability, and reliability. Network coding, widely used in communication systems, is adapted here to process and compress genomic data by employing finite field arithmetic and redundancy-aware encoding techniques. Our method achieves a compression ratio of up to 50% while maintaining a data integrity level of 99.99%, as validated through extensive mathematical analysis and experimental testing on diverse genomic datasets. Furthermore, the framework demonstrates linear scalability and robust error resilience, making it particularly suited for large-scale applications in clinical genomics and research. By bridging the gap between traditional compression algorithms and the growing demands of modern genomic data, this study lays the groundwork for more efficient and reliable data management solutions in bioinformatics.

Barkatullah University (IN)
Openalex Percentile: Top 11%
Algorithms and Data Compression
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Network Coding For Data Compression In Genomic Sequencing — Abhimanyu Sharma, Sultan Alam, et al. · (2025) | TGRS Research Map | TGRS