A comprehensive study of insertion-deletion system in dna computing

ISSN: 22773878
Citations of this article
Mendeley users who have this article in their library.


Problem-solving is an evergreen area due to the needs of the fast-growing electronics world. Thus, it is important to find an efficient solution for any given problem. The progress does not stop by finding an efficient solution, but it continues by proving the solution correctness. Thus, it is important to prove the correctness of the proposed solution. Either practical or theoretical justification can be used for proving the correctness of a solution. In a molecular computing field like DNA computing, proving the correctness of a solution is a time consuming and expensive task. Hence, in DNA computing, using insertion and deletion operations a number of theoretical models are proposed. These insertion and deletion operations are practically realized using well-known biological operations. In literature, it is also proved that these insertion-deletion systems are Turing equivalent. Also, the closure properties of these systems are studied. In this regard, it is important to study the existing insertion-deletion system in the literature. This study may be useful to define a new system in the future or to solve new problems using the existing insertion-deletion system. In this paper, a survey on the existing insertion-deletion system is done.




Sudha, V., & Easwarakumar, K. S. (2019). A comprehensive study of insertion-deletion system in dna computing. International Journal of Recent Technology and Engineering, 8(1), 1211–1213.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free