DocumentCode
476027
Title
A DNA algorithm for solving 0–1 programming
Author
Guo, Ping ; Liu, Li-Li
Author_Institution
Sch. of Comput. Sci., Chongqing Univ., Chongqing
Volume
2
fYear
2008
fDate
12-15 July 2008
Firstpage
1059
Lastpage
1063
Abstract
In this paper, DNA probes tagged with fluorescent label and a surface-based DNA algorithm are proposed to solve the 0-1 programming problem which inequalitiespsila coefficients expand to arbitrary integers. The algorithm works in O(m) steps for 0-1 programming problem with m constraint inequalities.
Keywords
biocomputing; constraint theory; mathematical programming; mathematics computing; 0-1 programming; constraint inequalities; fluorescent label; surface-based DNA algorithm; Bonding; Computational modeling; Computer science; Cybernetics; DNA computing; Fluorescence; Machine learning; Machine learning algorithms; Probes; Sequences; 0–1 programming problem; Bioinformatics; DNA computation model; surface model;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2008 International Conference on
Conference_Location
Kunming
Print_ISBN
978-1-4244-2095-7
Electronic_ISBN
978-1-4244-2096-4
Type
conf
DOI
10.1109/ICMLC.2008.4620561
Filename
4620561
Link To Document