Display Settings:

Format

Send to:

Choose Destination
    J Chem Inf Comput Sci. 2002 Mar-Apr;42(2):222-4.

    A Chinese Postman Problem based on DNA computing.

    Source

    Department of Control Science and Engineering, Hua Zhong University of Science and Technology, HuBei 430074, China. zxyin66@263.net, zhixiangyin@sohu.com

    Abstract

    DNA computing is a novel method for solving a class of intractable computational problems, in which the computing can grow exponentially with the problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. A Chinese Postman Problem has been solved by means of molecular biology techniques in the paper. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.

    PMID:
    11911690
    [PubMed - indexed for MEDLINE]

      Supplemental Content

      Icon for American Chemical Society

      Save items

      loading

      Recent activity

      Your browsing activity is empty.

      Activity recording is turned off.

      Turn recording back on

      See more...
      Write to the Help Desk