Transposition based contextual insertion on linear DNA strands with deletion precedence

Abstract

Insertion and deletion operations are two most important operations in molecular computation, and recently these two operations gained interest in the context of molecular computation. In the proposed system, single contextual insertion and usual (with two contexts) contextual deletions are used. In addition, it is assumed that the deletion operation has higher precedence than insertions, if both are possible at a moment. Given a word t, called a context, and the single contextual insertion is performed as follows. For each occurrence of the context t in the given string y, the word t is replaced as txt. In practice, this can be achieved by a replicative transposition process. Similarly, given a pair of words (u, v), called a context, the (u, v)-contextual deletion removes the word in between u and v. Finally, the power of this system and some closure properties are studied.

Keywords:

• DNA computation
• Watson–Crick complementary
• Replicative transposition
• Turing machine