Table 1 Parameters used for codebook generation
From: A highly parallel strategy for storage of digital information in living cells
Parameter | Explanation | Value |
|---|---|---|
Word length | Length of each codeword to be generated, also determines cipher block size | 4 |
Max mutations | Maximum number of mutations that can be recovered from per block. If this parameter is k, the algorithm generates codewords such that the minimum Levenshtein distance between them is 2 k + 1. | 1 |
Min. GC | Minimum GC composition in each codeword | 0.4 |
Max. GC | Maximum GC composition in each codeword | 0.6 |
Complexity | Minimum complexity (used as a proxy for repetitiveness) of each codeword | 0.75 |