Abstract
In Chap. 8 we formalized the MDS structure of micronuclear and intermediate genes through legal strings. In this chapter we shall formalize the gene assembly process in the framework of legal strings. Thus, we shall now formalize the three molecular operations ld, hi, and dlad as operations on (rewriting rules for) legal strings, obtaining string pointer reduction systems. Although the transition from MDS descriptors to legal strings represents an increase in abstraction (we only preserve in legal strings the sequence of pointers), we prove that string pointer reduction systems are equivalent to MDS descriptor pointer reduction systems as far as the strategies for gene assembly are concerned.
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.
Notes on References
Ehrenfeucht, A., Petre, I., Prescott, D. M., and Rozenberg, G., String and graph reduction systems for gene assembly in ciliates. Math. Structures Comput. Sci. 12 (2001) 113–134
Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D. M., and Rozenberg, G., Formal systems for gene assembly in ciliates. Theoret. Comput. Sci. 292 (2003) 199–219
Daley, M., Computational Modeling of Genetic Processes in Stichotrichous Ciliates. PhD thesis, University of London, Ontario, Canada (2003)
Daley, M., and Kari, L., Some properties of ciliate bio-operations. Lecture Notes in Comput. Sci. 2450 (2003) 116–127
Berman, P., and Hannenhalli, S., Fast sorting by reversals. Combinatorial Pattern Matching, Lecture Notes in Comput. Sci1 1072 (1996) 168–185
Caprara, A., Sorting by reversals is difficult. In S. Istrail, P. Pevzner and M. Waterman (eds.) Proceedings of the 1st Annual International Conference on Computational Molecular Biology (1997) pp. 75–83
Daley, M., Ibarra, O. H., and Kari, L., Closure propeties and decision questions of some language classes under ciliate bio-operations. Theoret. Comput. Sci.,to appear
Dassow, J., Mitrana, V., and Salomaa, A., Operations and languages generating devices suggested by the genome evolution. Theoret. Comput. Sci. 270 (2002) 701–738
Hannenhalli, S., and Pevzner, P. A., Transforming cabbage into turnip (Polynomial algorithm for sorting signed permutations by reversals). In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (1995) pp. 178–189
Kaplan, H., Shamir, R., and Tarjan, R. E., A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput. 29 (1999) 880–892
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D.M., Rozenberg, G. (2004). String Pointer Reduction System. In: Computation in Living Cells. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-06371-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-06371-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07401-1
Online ISBN: 978-3-662-06371-2
eBook Packages: Springer Book Archive