On the embedding capacity of DNA strands under insertion, deletion and substitution mutations
|Title:||On the embedding capacity of DNA strands under insertion, deletion and substitution mutations||Authors:||Balado, Félix||Permanent link:||http://hdl.handle.net/10197/1863||Date:||Jan-2010||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 unidimensional digital signal, DNA data embedding (diversely called DNA watermarking or DNA steganography) 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 or coding DNA hosts, which, respectively, denote DNA segments that cannot or can be translated into proteins. A limitation of existing DNA data embedding methods is that none of them have been designed according to optimal coding principles. It is not possible either to evaluate how close to optimality these methods are without determining the Shannon capacity of DNA data embedding. This is the main topic studied in this paper, where we consider that DNA sequences may be subject to substitution, insertion, and deletion mutations.||Funding Details:||Science Foundation Ireland||Type of material:||Conference Publication||Publisher:||SPIE--The International Society for Optical Engineering||Copyright (published version):||2010 Society of Photo-Optical Instrumentation Engineers||Keywords:||DNA data embedding; Data hiding; Steganography; Shannon capacity||Subject LCSH:||DNA
Data encryption (Computer science)
|DOI:||10.1117/12.838537||Language:||en||Status of Item:||Peer reviewed||Is part of:||Memon, N. D. et al. (eds.). Proceedings of SPIE-IS&T Electronic Imaging, SPIE Vol. 7541||Conference Details:||Paper presented at Media Forensics and Security XII, SPIE-IS&T Electronic Imaging conference, 18–20 January 2010, San Jose, California|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
Page view(s) 5381
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.