Welcome to the InfoSci Platform
The Application of DNA Self-Assembly Model for Bin Packing Problem

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

Yanfeng Wang, Xuewen Bai, Donghui Wei, Weili Lu, Guangzhao Cui
Copyright: © 2012 |Volume: 3 |Issue: 1 |Pages: 15
ISSN: 1947-928X|EISSN: 1947-9298|EISBN13: 9781466613652|DOI: 10.4018/jncr.2012010101
Cite Article Cite Article

MLA

Wang, Yanfeng, et al. "The Application of DNA Self-Assembly Model for Bin Packing Problem." IJNCR vol.3, no.1 2012: pp.1-15. http://doi.org/10.4018/jncr.2012010101

APA

Wang, Y., Bai, X., Wei, D., Lu, W., & Cui, G. (2012). The Application of DNA Self-Assembly Model for Bin Packing Problem. International Journal of Natural Computing Research (IJNCR), 3(1), 1-15. http://doi.org/10.4018/jncr.2012010101

Chicago

Wang, Yanfeng, et al. "The Application of DNA Self-Assembly Model for Bin Packing Problem," International Journal of Natural Computing Research (IJNCR) 3, no.1: 1-15. http://doi.org/10.4018/jncr.2012010101

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.