A String-Based Model for Simple Gene Assembly
The simple intramolecular model for gene assembly in ciliates is particularly interesting because it can predict the correct assembly of all available experimental data, although it is not universal. The simple model also has a confluence property that is not shared by the general model. A previous formalization of the simple model through sorting of signed permutations is unsatisfactory because it effectively ignores one operation of the model and thus, it cannot be used to answer questions about parallelism in the model, or about measures of complexity. We propose in this paper a string-based model in which a gene is represented through its sequence of pointers and markers and its assembly is represented as a string rewriting process. We prove that this string-based model is equivalent to the permutation-based model as far as gene assembly is concerned, while it tracks all operations of the model.
Unable to display preview. Download preview PDF.
- 2.Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D.M., Rozenberg, G.: Computation in Living Cells: Gene Assembly in Ciliates. Springer, Heidelberg (2003)Google Scholar
- 3.Ehrenfeucht, A., Prescott, D.M., Rozenberg, G.: Computational aspects of gene (un)scrambling in ciliates. In: Landweber, L.F., Winfree, E. (eds.) Evolution as Computation, pp. 216–256. Springer, New York (2001)Google Scholar
- 4.Harju, T., Li, C., Petre, I., Rozenberg, G.: Parallelism in gene assembly. Natural Computing (2006)Google Scholar
- 7.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)Google Scholar
- 8.Landweber, L.F., Kari, L.: Universal molecular computation in ciliates. In: Landweber, L.F., Winfree, E. (eds.) Evolution as Computation. Springer, New York (2002)Google Scholar