Skip to main content

Gene Assembly Algorithms for Ciliates

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4287))

Abstract

The micronuclear genes in stichotrichous ciliates are interrupted by multiple non-coding DNA segments. The coding segments are in scrambled disorder and can also be inverted. Identical short sequences (pointers) at the ends of the coding segments undergo homologous recombination to excise the non-coding segments and splice the coding ones. We consider the intramolecular model of Prescott, Ehrenfeucht, and Rozenberg for gene assembly in stichotrichous ciliates from the algorithmic point of view. We give a quadratic time algorithm for finding a successful sequence of operations to assemble a gene. We also prove an Ω(nlogn) lower bound on the amount of work needed to assemble genes, even when any pair of identical pointers have the same orientation. For the problem of finding the minimum number of operations needed to assemble a given gene, we give a heuristic quadratic algorithm which works well in practice. The complexity of this problem remains open.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D.M., Rozenberg, G.: Formal systems for gene assembly in ciliates. Theoret. Comput. Sci. 292, 199–219 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ehrenfeucht, A., Petre, I., Prescott, D.M., Rozenberg, G.: String and graph reduction systems for gene assembly in ciliates. Math. Structures Comput. Sci. 12, 113–134 (2001)

    MathSciNet  Google Scholar 

  3. Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D.M., Rozenberg, G.: Computation in Living Cells. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  4. Ehrenfeucht, A., Prescott, D.M., Rozenberg, G.: Computational aspects of gene (un)scrambling in ciliates. In: Landweber, L.F., Winfree, E. (eds.) Evolution as Computation, pp. 216–256. Springer, Heidelberg (2001)

    Google Scholar 

  5. Harju, T., Li, C., Petre, I., Rozenberg, G.: Parallelism in Gene Assembly. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 138–148. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Landweber, L.F., Kari, L.: 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 (1998)

    Google Scholar 

  7. Landweber, L.F., Kari, L.: Universal molecular computation in ciliates. In: Landweber, L.F., Winfree, E. (eds.) Evolution as Computation, pp. 257–274. Springer, Heidelberg (2002)

    Google Scholar 

  8. Prescott, D.M., Ehrenfeucht, A., Rozenberg, G.: Molecular operations for DNA processing in hypotrichous ciliates. Europ. J. Protistology 37, 241–260 (2001)

    Article  Google Scholar 

  9. Prescott, D.M., Rozenberg, G.: Encrypted genes and their reassembly in ciliates. In: Amos, M. (ed.) Cellular Computing, pp. 171–201. Oxford University Press, Oxford (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ilie, L., Solis-Oba, R. (2006). Gene Assembly Algorithms for Ciliates. In: Mao, C., Yokomori, T. (eds) DNA Computing. DNA 2006. Lecture Notes in Computer Science, vol 4287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925903_6

Download citation

  • DOI: https://doi.org/10.1007/11925903_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49024-1

  • Online ISBN: 978-3-540-68423-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics