Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
A boundary result on enhanced time-varying distributed H systems with parallel computations
Theoretical Computer Science
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Hi-index | 0.00 |
In this article we propose a formalization of protocols simulating the separation of molecules by gel electrophoresis. In our model, we introduce a new concept, namely, filtering by length – a direct formalization of the gel electrophoresis action. We also define a distributed computational model based on this action and on the splicing operation, called length-separating splicing test tube systems. We prove that these constructs, even with restricted size parameters, can simulate the Turing machines. We also discuss different natural restrictions and generalizations of the model which may be used to find efficient ways to realize DNA transformations in the laboratory.