On the embedding capacity of DNA strands under substitution, insertion, and deletion mutations

Abstract

A number of methods have been proposed over the last decade for embedding information within deoxyribonucleic acid (DNA). Since a DNA sequence is conceptually equivalent to a unidim ensional digital signal, DNA data embedding (diversely called DNA watermarking or DNA steganograph y) can be seen either as a traditional communications problem or as an instance of communications with side information at the encoder, similar to data hiding. These two cases correspond to the use of noncoding o r coding DNA hosts, which, respectively, denote DNA segments that cannot or can be translated into proteins. A limit ation of existing DNA data embedding methods is that none of them have been designed according to optim al coding principles. It is not possible either to evaluate how close to optimality these methods are without deter mining the Shannon capacity of DNA data embedding. This is the main topic studied in this paper, where we consid er that DNA sequences may be subject to substitution, insertion, and deletion mutations.