Abstract
In this chapter we consider a graph theoretic framework for gene assembly where segments of genes are distributed over a set of circular molecules. Our main motivation still lies in the gene assembly process of ciliates. However, the model in this chapter is more general, and it can be seen as a graph theoretic formulation of the “fold and recombine” computing paradigm.
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., Harju, T., and Rozenberg, G., Gene assembly through cyclic graph decomposition. Theoret. Comput. Sci. 281 (2002) 325–349
Kotzig, A., Moves without forbidden transitions in graph. Mat. casopis 18 (1968) 76–80
Pevzner, P. A., DNA physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica 13 (1995) 77–105
Pevzner, P. A., Computational Molecular Biology: An Algorithmic Approach. MIT Press (2000)
Tucker, A. C., A new applicable proof of the Euler circuit theorem. Amer. Math. Monthly 83 (1976) 638–640
West, D. B., Introduction to Graph Theory, Prentice Hall, Upper Saddle River, NJ (1996)
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). Gene Assembly Through Cyclic Graph Decomposition. In: Computation in Living Cells. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-06371-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-06371-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07401-1
Online ISBN: 978-3-662-06371-2
eBook Packages: Springer Book Archive