Parallel detection of all palindromes in a string
Theoretical Computer Science
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Journal of the ACM (JACM)
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Real-time algorithms for string-matching and palindrome recognition
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Reversible hiding in DCT-based compressed images
Information Sciences: an International Journal
Joint coding and embedding techniques for multimedia images
Information Sciences: an International Journal
Fidelity-guaranteed robustness enhancement of blind-detection watermarking schemes
Information Sciences: an International Journal
Prediction-based reversible data hiding
Information Sciences: an International Journal
Reversible data hiding based on block median preservation
Information Sciences: an International Journal
Perceptually adaptive spread transform image watermarking scheme using Hadamard transform
Information Sciences: an International Journal
Tabu search based multi-watermarks embedding algorithm with multiple description coding
Information Sciences: an International Journal
High-payload image hiding with quality recovery using tri-way pixel-value differencing
Information Sciences: an International Journal
Image encryption using DNA complementary rule and chaotic maps
Applied Soft Computing
A Molecular Solution to the Three-Partition Problem
Journal of Information Technology Research
An information security-based literature survey and classification framework of data storage in DNA
International Journal of Networking and Virtual Organisations
Hi-index | 0.07 |
In this paper, three data hiding methods are proposed, based upon properties of DNA sequences. It is highlighted that DNA sequences possess some interesting properties which can be utilized to hide data. These three methods are: the Insertion Method, the Complementary Pair Method and the Substitution Method. For each method, a reference DNA sequence S is selected and the secret message M is incorporated into it so that S^' is obtained. S^' is then sent to the receiver and the receiver is able to identify and extract the message M hidden in S^'. Furthermore, the robustness and the tightly embedded capacity analysis of the three proposed methods are demonstrated. Finally, experimental results indicate a better performance of the proposed methods compared to the performance of the competing methods with respect to several parameters such as capacity, payload and bpn.