Abstract
DNA computing is a novel method of solving a class of intractable computational problem, in which the computing speeds up exponentially with problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. The positive integer linear programming is an NP-complete problem, in the paper, we solved the positive integer linear programming problem with fluorescence labeling techniques based on surface chemistry by attempted to apply DNA computing to programming problem. Our method has some significant advantages such as simple encoding, low cost, and short operating time. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Yin, Z. X., Cui, J. Z., & Yang, J. (2007). A surface-based DNA computing for the positive integer linear programming problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4681 LNCS, pp. 1–9). Springer Verlag. https://doi.org/10.1007/978-3-540-74171-8_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
