Options
Performance of DNA data embedding algorithms under substitution mutations
File(s)
File | Description | Size | Format | |
---|---|---|---|---|
Performance of DNA Data Embedding Algorithms under Substitution Mutations - David Haughton and Felix Balado.pdf | 356.35 KB |
Author(s)
Date Issued
December 2010
Date Available
17T12:57:51Z January 2011
Abstract
DNA data embedding is a relatively recent area which aims at embedding arbitrary information in deoxyribonucleic acid (DNA) strands. One interesting application of DNA data embedding can be tracing pathways of genetic material in novel ways. This paper explores the decoding performance of several DNA data embedding algorithms proposed in the literature, which are also briefly reviewed. DNA may undergo random mutations, which can cause errors at the decoding stage of such algorithms. Although some proposed methods do account for such errors, decoding performance under mutations has not been previously studied in general. The empirical performance comparison that we provide here allows to fairly compare a number of DNA data embedding algorithms under mutations for the first time. The evaluation is undertaken by means of Monte Carlo simulations. Additionally, we propose two new DNA data embedding algorithms with good robustness properties.
Sponsorship
Science Foundation Ireland
Type of Material
Conference Publication
Copyright (Published Version)
2010 IEEE
Subject – LCSH
DNA
Data encryption (Computer science)
Digital watermarking
Language
English
Status of Item
Peer reviewed
Conference Details
IEEE International Conference on Bioinformatics and Biomedicine (BIBM2010), 18-21 December, 2010, Hong Kong
This item is made available under a Creative Commons License
Owning collection
Views
1598
Last Month
2
2
Acquisition Date
Jun 2, 2023
Jun 2, 2023
Downloads
632
Last Week
2
2
Last Month
10
10
Acquisition Date
Jun 2, 2023
Jun 2, 2023