Abstract
We move now to consider a substantial simplification of representing micronuclear and intermediate genes. We shall use only the sequence of pointers in the order in which they appear in such a gene, obtaining in this way just a string of pointers. This yields the framework of legal strings, which is more abstract than the framework of MDS descriptors because different MDS descriptors may yield the same legal string. In this chapter we investigate the basic properties of the representation of the MDS structure by legal strings. In particular, we characterize those legals string that either correspond directly to realistic MDS descriptors or that can be signed so as to correspond to realistic MDS descriptors.
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
Bouchet, A., Circle graphs. Combinatorica 7 (1987) 243–254
de Fraysseix, H., A characterization of circle graphs. European J. Combin. 5 (1984) 223–238
de Fraysseix, H., and Ossona de Mendez, P., A short proof of a Gauss problem. Lecture Notes in Comput. Sci. 1353 (1997) 230–235
Ehrenfeucht, A., Harju, T., Petre, I., and Rozenberg, G., Patterns of micronuclear genes in cliates. Lecture Notes in Comput. Sci. 2340 (2002) 279–289
Ehrenfeucht, A., Harju, T., Petre, I., and Rozenberg, G., Characterizing the micronuclear gene patterns in ciliates. Theory of Comput. Syst. 35 (2002) 501–519
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
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
Harju, T., and Rozenberg, G., Computational processes in living cells: gene assembly in ciliates. Lecure Notes in Comput. Sci. 2450 (2003) 1–20
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). Legal Strings. In: Computation in Living Cells. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-06371-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-06371-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07401-1
Online ISBN: 978-3-662-06371-2
eBook Packages: Springer Book Archive