Abstract
In this paper, we first describe the isothermal constrained loop extension DNA amplification (ICLEDA), which is a new variant of amplification combining the advantages of rolling circle amplification (RCA) and of strand displacement amplification (SDA). Then, we formalize this process in terms of the theory of formal languages and show, on the basis of this formulation, how to manage OR and AND gates. We then explain how to introduce negation, which allows us to prove that, in principle, it is possible to implement the computation of any boolean function on DNA strands using ICLEDA.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.