Name
Abstract | ||
|---|---|---|
Biochemical reaction theory based DNA computation is of much better performance in solving a class of intractable computational
problems such as NP-complete problems, it is important to study the DNA computation. A novel algorithm based on DNA computation
is proposed, which solves a special category of 0-1 planning problem by using the surface-based fluorescence labeling technique.
The analysis show that our new algorithm is of significant advantages such as simple encoding, low cost and short operating
time, etc.
|
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11424925_77 | ICCSA |
Keywords | Field | DocType |
np complete problem,dna computing | NP-complete,Mathematical optimization,Computational problem,Operating time,Computer science,Constraint algorithm,Algorithm,DNA,Operating cost,Computation,Encoding (memory) | Conference |
Volume | Issue | ISSN |
3483 | IV | 18600794 |
ISBN | Citations | PageRank |
3-540-25863-9 | 0 | 0.34 |
References | Authors | |
2 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wang Lei | 1 | 11 | 3.06 |
| Zhiping P. Chen | 2 | 3 | 0.82 |
| Xinhua H. Jiang | 3 | 0 | 0.34 |
| Liu Shaoli | 4 | 0 | 0.34 |
| Lihong V Wang | 5 | 194 | 58.39 |
| ZP Chen | 6 | 0 | 1.01 |
| XH Jiang | 7 | 0 | 1.35 |
| SL Liu | 8 | 0 | 0.34 |