Soft Computing

, Volume 12, Issue 8, pp 731–737 | Cite as

Parallel complexity of signed graphs for gene assembly in ciliates

  • Tero Harju
  • Chang Li
  • Ion Petre
Original Paper


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.


Ciliates Gene assembly Graph model Parallelism Complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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–15154CrossRefGoogle Scholar
  2. Ehrenfeucht A, Harju T, Petre I, Prescott DM, Rozenberg G (2004) Computation in living cells: gene assembly in ciliates. Springer, HeidelbergMATHGoogle Scholar
  3. 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–256Google Scholar
  4. 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–254CrossRefGoogle Scholar
  5. Harju T, Li C, Petre I (2007) Graph theoretical approach to ciliates gene assembly (submitted manuscript)Google Scholar
  6. 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–150Google Scholar
  7. Harju T, Li C, Petre I, Rozenberg G (2006) Parallelism in gene assembly. Nat Comput 5:203–223MATHCrossRefMathSciNetGoogle Scholar
  8. Jahn CL, Klobutcher LA (2000) Genome remodeling in ciliated protozoa. Ann Rev Microbiol 56:489–520CrossRefGoogle Scholar
  9. 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–15Google Scholar
  10. Landweber LF, Kari L (2002) Universal molecular computation in ciliates. In: Landweber LF, Winfree E (eds) Evolution as computation. Springer, BerlinGoogle Scholar
  11. Prescott DM (1994) The DNA of ciliated protozoa. Microbiol Rev 58(2):233–267Google Scholar
  12. Prescott DM (2000) Genome Gymnastics: unique modes of DNA evolution and processing in ciliates. Nat Rev Genet 1:191–198CrossRefGoogle Scholar
  13. 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–417Google Scholar
  14. Prescott DM, Ehrenfeucht A, Rozenberg G (2001) Molecular operations for DNA processing in hypotrichous ciliates. Eur J Protistol 37:241–260CrossRefGoogle Scholar
  15. Yao MC, Fuller P, Xi X (2003) Programmed DNA deletion as an RNA-guided system of genome defense. Science 300:1581–1584CrossRefGoogle Scholar
  16. Gene assembly simulator (2006)

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of Turku, Turku Center for Computer ScienceTurkuFinland
  2. 2.Department of ITÅbo Akademi University, Turku Center for Computer ScienceTurkuFinland
  3. 3.Academy of FinlandHelsinkiFinland

Personalised recommendations