IDEAS home Printed from https://ideas.repec.org/a/igg/jncr00/v3y2012i1p1-15.html
   My bibliography  Save this article

The Application of DNA Self-Assembly Model for Bin Packing Problem

Author

Listed:
  • Yanfeng Wang

    (Zhengzhou University of Light Industry, China)

  • Xuewen Bai

    (Zhengzhou University of Light Industry, China)

  • Donghui Wei

    (Zhengzhou University of Light Industry, China)

  • Weili Lu

    (Zhengzhou University of Light Industry, China)

  • Guangzhao Cui

    (Zhengzhou University of Light Industry, China)

Abstract

Bin Packing Problem (BPP) is a classical combinatorial optimization problem of graph theory, which has been proved to be NP-complete, and has high computational complexity. DNA self-assembly, a formal model of crystal growth, has been proposed as a mechanism for the bottom-up fabrication of autonomous DNA computing. In this paper, the authors propose a DNA self-assembly model for solving the BPP, this model consists of two units: grouping based on binary method and subtraction system. The great advantage of the model is that the number of DNA tile types used in the model is constant and it can solve any BPP within linear time. This work demonstrates the ability of DNA tiles to solve other NP-complete problems in the future.

Suggested Citation

  • Yanfeng Wang & Xuewen Bai & Donghui Wei & Weili Lu & Guangzhao Cui, 2012. "The Application of DNA Self-Assembly Model for Bin Packing Problem," International Journal of Natural Computing Research (IJNCR), IGI Global, vol. 3(1), pages 1-15, January.
    • Handle: RePEc:igg:jncr00:v:3:y:2012:i:1:p:1-15
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jncr.2012010101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jncr00:v:3:y:2012:i:1:p:1-15. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.