Skip to content

Latest commit

History

History
11 lines (6 loc) 路 1.12 KB

ALGORITHM.md

File metadata and controls

11 lines (6 loc) 路 1.12 KB

Context

Going from textual input to the psuedo base-4 system that DNA represents (CATG) doesn't seem optimal or effective at all prima facie, but there is more to it than meets the eye.

But nature, given millions of years of evolution, has fine-tuned its owned compression algorithm. Yet it only works on DNA - which is limited to 4 bases: C(ytosine), A(denine), T(hymine), G(guanine). The DNA replication process is error prone but there are heuristics we can use (getting multiple strands of our sequence being one) to detect errors. After you've generated DNA from an input, getting the data back out is significatly inefficient at this point, so the ideal use case of DNA would be archiving data that you don't need frequent access to.

DNA vis-a-viz other storage methods

There are three distinct steps:

DNA encoding schemes