Abstract
The theory of gene assembly in ciliates has a number of similarities with the theory of sorting by reversal. Both theories model processes that are based on splicing, and have a fixed begin and end product. The main difference is the type of splicing operations used to obtain the end product from the begin product. In this overview paper, we show how the concept of breakpoint graph, known from the theory of sorting by reversal, can be used in the theory of gene assembly. Our aim is to present the material in an intuitive and informal manner to allow for an efficient introduction into the subject.
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.
References
Bergeron A, Mixtacki J, Stoye J (2005) On sorting by translocations. In: Miyano S et al. (eds) RECOMB. Lecture notes in computer science, vol 3500. Springer, Berlin, pp 615–629
Brijder R, Hoogeboom HJ (2008) The fibers and range of reduction graphs in ciliates. Acta Inform 45:383–402. doi:10.1007/s00236-008-0074-3
Brijder R, Hoogeboom HJ, Muskulus M (2008) Strategies of loop recombination in ciliates. Discrete Appl Math 156:1736–1753. doi:10.1016/j.dam.2007.08.032
Brijder R, Hoogeboom HJ, Rozenberg G (2006) Reducibility of gene patterns in ciliates using the breakpoint graph. Theor Comput Sci 356:26–45
Cavalcanti ARO, Clarke TH, Landweber LF (2005) MDS_IES_DB: a database of macronuclear and micronuclear genes in spirotrichous ciliates. Nucleic Acids Res 33:D396–D398
Ehrenfeucht A, Harju T, Petre I, Prescott DM, Rozenberg G (2003) Formal systems for gene assembly in ciliates. Theor Comput Sci 292:199–219
Ehrenfeucht A, Harju T, Petre I, Prescott DM, Rozenberg G (2004) Computation in living cells—gene assembly in ciliates. Springer, Berlin
Hannenhalli S, Pevzner PA (1999) Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J ACM 46(1):1–27
Harju T, Li C, Petre I, Rozenberg G (2006) Parallelism in gene assembly. Nat Comput 5(2):203–223
Landweber LF, Kari L (1999) The evolution of cellular computing: nature’s solution to a computational problem. Biosystems 52:2–13
Pevzner PA (2000) Computational molecular biology: an algorithmic approach. MIT Press, Cambridge
Prescott DM, DuBois M (1996) Internal eliminated segments (IESs) of oxytrichidae. J Euk Microbiol 43:432–441
Setubal JC, Meidanis J (1997) Introduction to computational molecular biology. PWS, Boston
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brijder, R., Hoogeboom, H.J. (2009). Reality-and-Desire in Ciliates. In: Condon, A., Harel, D., Kok, J., Salomaa, A., Winfree, E. (eds) Algorithmic Bioprocesses. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88869-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-88869-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88868-0
Online ISBN: 978-3-540-88869-7
eBook Packages: Computer ScienceComputer Science (R0)