Skip to main content
SpringerLink
Log in

Application of DNA computing in graph theory

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Although DNA computing was rapidly discarded when researchers realized some of the drawbacks related to it, but by computer simulation of molecular reaction it may be implemented in silico by computer architectures offering massive parallelism. In this review, we describe sticker algorithm for several famous graph problem. Presented algorithms have polynomial time complexity.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266: 1021–1024

    Article  Google Scholar 

  • Adleman L (1998) Computing with DNA. Sci Am 279(2): 54–61

    Article  Google Scholar 

  • Amos M, Pãun G, Rozenberg G, Salomaa A (2002) Topic in the theory of DNA computing. Theor Comput Sci 287: 3–38

    Article  MATH  Google Scholar 

  • Darehmiraki M (2009) A new solution for maximal clique problem based sticker model. Biosystems 95: 145–149

    Article  Google Scholar 

  • Deo N (2005) Graph theory with applications to engineering and computer science. Prentice-Hall of India Private Limited, New Delhi, pp 61–63

    Google Scholar 

  • Guo M, Chang W-L, Cao J (2004) Using sticker to solve the 3-dimensional matching problem in molecular super computers. Int J High Perform Comput Netw 1(1/2/3): 128–139

    Article  MATH  Google Scholar 

  • Guo M, Ho M, Chang W-L (2004) Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing. Parallel Comput 30: 1109–1125

    Article  MathSciNet  Google Scholar 

  • Guo M, Chang W-L, Ho M, Lu J, Cao J (2005) Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing. Biosystems 80(1): 71–82

    Article  Google Scholar 

  • Hsieh S-Y, Chen M-Y (2008) A DNA-based solution to the graph isomorphism problem using Adleman–Lipton model with stickerts. Appl Math Comput 197: 627–686

    Article  MathSciNet  Google Scholar 

  • Papadimitriou CH, Steiglitz K (2003) Combinatorial optimization algorithm and complexity. Prentice-Hall of India Private Limited, New Delhi, pp 370–371

    Google Scholar 

  • Qiu ZF, Lu M (2003) A new approach to advance the DNA computing. Appl Soft Comput 3: 177–189

    Article  Google Scholar 

  • Wang Z, Xiao D, Li W, He L (2006) A DNA procedure for solving the shortest path problem. Appl Math Comput 183: 79–84

    Article  MathSciNet  MATH  Google Scholar 

  • Yeh C-W, Chu C-P, Wu K-R (2005) Molecular solution to the binary integer programming problem based DNA computing. Biosystems 83: 56–66

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Birjand, Birjand, Iran

    Hossein Eghdami

  2. Department of Mathematics, Khatam alanbia University of technology, Behbahan, Khouzestan, Iran

    Majid Darehmiraki

Authors
  1. Hossein Eghdami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Majid Darehmiraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Majid Darehmiraki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eghdami, H., Darehmiraki, M. Application of DNA computing in graph theory. Artif Intell Rev 38, 223–235 (2012). https://doi.org/10.1007/s10462-011-9247-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-011-9247-5

Keywords

Search

Navigation