Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2006: Developments in Language Theory pp 180–191Cite as

Characterizing DNA Bond Shapes Using Trajectories

  • Conference paper

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

Abstract

We consider the use of DNA trajectories to characterize DNA bond shapes. This is an extension of recent work on the bond-free properties of a language. Using an new definition of bond-freeness, we show that we can increase the types of DNA bond shapes which are expressible. This is motivated by the types of bond shapes frequently found in DNA computing.

We examine the algebraic properties of sets of trajectories. In particular, we consider rotation of trajectories and weakening of the bonding conditions expressed by a set of DNA trajectories. We also consider decidability results for bond-freeness with respect to our definition.

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

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. Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)

    Article  Google Scholar 

  2. Amos, M.: Theoretical and Experimental DNA Computation. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  3. Domaratzki, M.: Hairpin structures defined by DNA trajectories. Technical Report TR-2006-001, Jodrey School of Computer Science, Acadia University (submitted for publication, 2006)

    Google Scholar 

  4. Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. Theor. Comp. Sci. 290(3), 1557–1579 (2002)

    Article  MathSciNet  Google Scholar 

  5. Jonoska, N., Kephart, D., Mahalingam, K.: Generating DNA code words. Congressus Numerantium 156, 99–110 (2002)

    MathSciNet  Google Scholar 

  6. Kari, L., Kitto, R., Thierrin, G.: Codes, involutions and DNA encoding. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 376–393. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Kari, L., Konstantinidis, S., Losseva, E., Sosík, P., Thierrin, G.: Hairpin structures in DNA words. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 158–170. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Kari, L., Konstantinidis, S., Losseva, E., Wozniak, G.: Sticky-free and overhang-free DNA languages. Acta Inform. 40, 119–157 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kari, L., Konstantinidis, S., Sosík, P.: Bond-free languages: Formalisms, maximality and construction methods. Int. J. Found. Comp. Sci. 16, 1039–1070 (2005)

    Article  MATH  Google Scholar 

  10. Kari, L., Konstantinidis, S., Sosík, P.: On properties of bond-free DNA languages. Theor. Comp. Sci. 334, 131–159 (2005)

    Article  MATH  Google Scholar 

  11. Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theor. Comp. Sci. 197, 1–56 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  13. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jodrey School of Computer Science, Acadia University, Wolfville, NS, B4P 2R6, Canada

    Michael Domaratzki

Authors
  1. Michael Domaratzki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, WA 99164, Pullman, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Domaratzki, M. (2006). Characterizing DNA Bond Shapes Using Trajectories. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_17

Download citation

  • DOI: https://doi.org/10.1007/11779148_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35428-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation