Skip to main content
Log in

An algorithmic analysis of DNA structure

  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Bilinearity, complementarity and antiparallelism of the double stranded DNA structure are proved, in a general and abstract setting, as requirements of an efficient duplication algorithm for ‘mobile strings’.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Adleman LM (1994) Science 266:1021–1024

    Google Scholar 

  2. Bennett J (1970) Am Philos Quat 7:175–191

    Google Scholar 

  3. Garrett RH, Grisham CM (1997) Biochemistry. Saunders College Publishing

  4. Manca V, Martino MD (1999) Grammatical models of multi-agent systems. Gordon and Breach Science Publishers, London pp 297–315

  5. Manca V (2002) International Meeting DNA Based Computers Hagiya M., Ohuchi A. (eds) Sapporo, Japan p 330

  6. Păun Gh (2002) Membrane computing. An introduction Springer, Berlin Heidelberg New York

  7. Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages Springer, Berlin Heidelberg New York

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vincenzo Manca.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Franco, G., Manca, V. An algorithmic analysis of DNA structure. Soft Comput 9, 761–768 (2005). https://doi.org/10.1007/s00500-004-0441-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-004-0441-0

Keywords

Navigation