Abstract
The intramolecular gene assembly model, [1], uses three molecular recombination operations ld, dlad, and hi. A computing model with two contextual recombination operations del and trl, which are based on ld and dlad, respectively, is considered in [6] and its computational power is investigated. In the present paper, we expand the computing model with a new molecular operation such as cpy - copy. Then we prove that the extended contextual intramolecular gene assembly model is both computationally universal and efficient.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D.M., Rozenberg, G.: Computation in Living Cells: Gene Assembly in Ciliates. Springer, Heidelberg (2003)
Galiukschov, B.S.: Semicontextual grammars, Mathematika Logica i Matematika Linguistika, Talinin University (in Russian) , pp. 38–50 (1981)
Garey, M., Jonhson, D.: Computers and Interactability. A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)
Harju, T., Petre, I., Li, C., Rozenberg, G.: Parallelism in gene assembly. In: Proceedings of DNA-based computers 10, Springer, Heidelberg (2005)
Head, T.: Formal Language Theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biology 49, 737–759 (1987)
Ishdorj, T.-O., Petre, I., Rogojin, V.: Computational Power of Intramolecular Gene Assembly. International Journal of Foundations of Computer Science (to appear)
Kari, L., Thierrin, G.: Contextual insertion/deletions and computability. Information and Computation 131, 47–61 (1996)
Landweber, L.F., Kari, L.: The evolution of cellular computing: Nature’s solution to a computational problem. In: Proceedings of the 4th DIMACS Meeting on DNA-Based Computers, Philadelphia, PA, pp. 3–15 (1998)
Marcus, S.: Contextual grammars. Revue Roumaine de Matématique Pures et Appliquées 14, 1525–1534 (1969)
Papadimitriou, C.P.: Computational Complexity. Addison-Wesley, Reading (1994)
Păun, Gh.: Marcus Contextual Grammars. Kluwer, Dordrecht (1997)
Păun, Gh., Rozenberg, G., Salomaa, A.: DNA Computing - New computing paradigms. Springer, Heidelberg (1998)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Searls, D.B.: Formal language theory and biological macromolecules. Series in Discrete Mathematics and Theoretical Computer Science 47, 117–140 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishdorj, TO., Petre, I. (2007). Computing Through Gene Assembly. In: Akl, S.G., Calude, C.S., Dinneen, M.J., Rozenberg, G., Wareham, H.T. (eds) Unconventional Computation. UC 2007. Lecture Notes in Computer Science, vol 4618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73554-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-73554-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73553-3
Online ISBN: 978-3-540-73554-0
eBook Packages: Computer ScienceComputer Science (R0)