Algorithm for DNA as archival storage solution
| Author(s) | : | Parihar Devendra, Managori Husain, Parihar Pratibha |
| Institution | : | Department of Biotechnology, Genetics and Bioinformatics, N. V. Patel college of Pure and Applied Sciences, Sardar Patel University, Vallabh Vidyanagar-388120, Gujarat, India |
| Published In | : | Vol. 6, Issue 11 — November 2019 |
| Page No. | : | 28-31 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Big Data is an ocean of information generated by humans or machines in high volume, velocity and/or variety. Suchvoluminous data cannot be processed with present database or software and due to limited storage capacity failed tocapture, store, manage and analyse the data. Data generated by Large Hadron Collider (LHC) is approximately 25petabytes per year, thus need for a better data storage medium. Deoxyribonucleic acid (DNA) is extremely dense with anapproximate storage limit of 1 exabyte/mm3 (109 GB/mm3), and has a half-life of 500 years far more long-lasting than themagnetic tape and hard-drives. Theoretically, one can encode 2 bits per nucleotide in DNA that can store 455 exabytesper gram maximum data in single-stranded DNA.
Parihar Devendra, Managori Husain, Parihar Pratibha, “Algorithm for DNA as archival storage solution”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 6, Issue 11, pp. 28-31, November 2019.
