Display Settings:

Format

Send to:

Choose Destination
    Biosystems. 2004 Dec;78(1-3):39-47.

    Solving traveling salesman problems with DNA molecules encoding numerical values.

    Source

    School of Chemical Engineering, Seoul National University, San 56-1 Shillim-Dong, Kwanak-Gu, Seoul 151-744, Republic of Korea.

    Abstract

    We introduce a DNA encoding method to represent numerical values and a biased molecular algorithm based on the thermodynamic properties of DNA. DNA strands are designed to encode real values by variation of their melting temperatures. The thermodynamic properties of DNA are used for effective local search of optimal solutions using biochemical techniques, such as denaturation temperature gradient polymerase chain reaction and temperature gradient gel electrophoresis. The proposed method was successfully applied to the traveling salesman problem, an instance of optimization problems on weighted graphs. This work extends the capability of DNA computing to solving numerical optimization problems, which is contrasted with other DNA computing methods focusing on logical problem solving.

    PMID:
    15555757
    [PubMed - indexed for MEDLINE]

      Supplemental Content

      Icon for Elsevier Science

      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