Abstract
We consider a graph-based model for the study of parallelism in ciliate gene assembly, where a signed graph is associated to each micronuclear gene and the gene assembly is modeled as a graph rewriting process. A natural measure of complexity for gene assembly counts the minimal number of parallel steps needed to reduce the associated signed graph. We investigate the complexity of several classes of the graphs, so far found graphs of parallel complexity up to six. The general problem of whether there exists a finite upper bound for the graph parallel complexity still remains open.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chang WJ, Bryson PD, Liang H, Shin MK, Landweber L (2005) The evolutionary origin of a complex scrambled gene. Proc Natl Acad Sci US 102(42):15149–15154
Ehrenfeucht A, Harju T, Petre I, Prescott DM, Rozenberg G (2004) Computation in living cells: gene assembly in ciliates. Springer, Heidelberg
Ehrenfeucht A, Prescott DM, Rozenberg G (2001) Computational aspects of gene (un)scrambling in ciliates. In: Landweber LF, Winfree E (eds) Evolution as computation. Springer, Berlin, pp 216–256
Fleury A, Delgado F, Adoutte A (1992) Molecular phylogeny of ciliates: what does it tell us about the evolution of the cytoskeleton and of developmental strategies? Dev Genet 13:247–254
Harju T, Li C, Petre I (2007) Graph theoretical approach to ciliates gene assembly (submitted manuscript)
Harju T, Li C, Petre I, Rozenberg G (2005) Parallelism in gene assemby, In: Proceedings of the 10th international meeting on DNA-based computers DNA 10, Milan, Italy. Lecture Notes in Computer Science, vol 3384, pp 140–150
Harju T, Li C, Petre I, Rozenberg G (2006) Parallelism in gene assembly. Nat Comput 5:203–223
Jahn CL, Klobutcher LA (2000) Genome remodeling in ciliated protozoa. Ann Rev Microbiol 56:489–520
Landweber LF, Kari L (1998) 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
Landweber LF, Kari L (2002) Universal molecular computation in ciliates. In: Landweber LF, Winfree E (eds) Evolution as computation. Springer, Berlin
Prescott DM (1994) The DNA of ciliated protozoa. Microbiol Rev 58(2):233–267
Prescott DM (2000) Genome Gymnastics: unique modes of DNA evolution and processing in ciliates. Nat Rev Genet 1:191–198
Prescott DM (2002) DNA manipulations in ciliates. In: Brauer W, Ehrig H, Jarhumäki J, Salomaa A (eds) Formal and natural computing: essays dedicated to Grzegorz Rozenberg. LNCS, vol 2300. Springer, Heidelberg, pp 394–417
Prescott DM, Ehrenfeucht A, Rozenberg G (2001) Molecular operations for DNA processing in hypotrichous ciliates. Eur J Protistol 37:241–260
Yao MC, Fuller P, Xi X (2003) Programmed DNA deletion as an RNA-guided system of genome defense. Science 300:1581–1584
Gene assembly simulator (2006) http://combio.abo.fi/simulator/simulator.php
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Harju, T., Li, C. & Petre, I. Parallel complexity of signed graphs for gene assembly in ciliates. Soft Comput 12, 731–737 (2008). https://doi.org/10.1007/s00500-007-0233-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-007-0233-4