today, optimal performance and cost advantages of using internet telephony are obvious. despite current standardized techniques, voice transferring through protocol (voip) has lower security than traditional telephony. one of the most important security issues which should be noticed in using voip is end -to-end user2 identity, i.e. when  there is a connection between user a and b, user a shoul...

An n-string tangle is a three dimensional ball with n strings which are properly embedded in it. Topological tangle analysis of DNA-protein complexes based on difference topology experiments are studied for last 30 years. In this paper, A 2-string tangle analysis of DNA-Tn3 complex [5, 6] and a 3-string tangle analysis of DNA-Mu complex [3, 13] and a biologically relevant 4-string tangle analys...

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...

String matching is considered as one of the center issues within field computer science, where there are numerous applications that supply clients with string services. The increment number databases which created and protected in gadgets had impacted researchers slant towards getting robust techniques tending to this issue. In study, Maximum-Shift algorithm chosen be executed multi-core innova...

In this paper, we propose an algorithm to hide secret message in DNA String to increase the security during transmission of data. On preparation, we consider the behavior and characteristics of DNA sequences. In this paper, we propose a new Binary Coded DNA rules towards Data Hiding in DNA. DNA String is identified randomly where a secret message is encoded at Sender’s end. Same DNA String is u...

Pattern matching, the problem of finding sub sequences within a long sequence is essential for many applications such as information retrieval, disease analysis, structural and functional analysis, logic programming, theorem-proving, term rewriting and DNA-computing. In computational biology the essential components for DNA applications is the exact string matching algorithms. Many databases li...

Abstract From a programming perspective, DNA is stunningly simple: string of bits coding two types interactions. The specific chemical form given to us by evolution imposes significant constraints on what possible with nanotechnology. In this paper, I propose three designs for new digital DNA-like polymers that retain the essential information-bearing properties while enabling functions not ach...