摘要
0-1 programming problem is an important problem in opsearch with very widespread applications. In this paper, a new DNA computation model utilizing solution-based and surface-based methods is presented to solve the 0-1 programming problem. This model contains the major benefits of both solution-based and surface-based methods; including vast parallelism, extraordinary information density and ease of operation. The result, verified by biological experimentation, revealed the potential of DNA computation in solving complex programming problem.
源语言 | 英语 |
---|---|
页(从-至) | 9-14 |
页数 | 6 |
期刊 | BioSystems |
卷 | 74 |
期 | 1-3 |
DOI | |
出版状态 | 已出版 - 2004 |
已对外发布 | 是 |
指纹
探究 'DNA computation model to solve 0-1 programming problem' 的科研主题。它们共同构成独一无二的指纹。引用此
Zhang, F., Yin, Z., Liu, B., & Xu, J. (2004). DNA computation model to solve 0-1 programming problem. BioSystems, 74(1-3), 9-14. https://doi.org/10.1016/j.biosystems.2003.12.001