메뉴 건너뛰기




Volumn 3, Issue 2, 2003, Pages 177-189

A new approach to advance the DNA computing

Author keywords

Coloring problem; DNA computing; Error resistant; Larger size problem; Molecular computing; Parallel processing; Speedup

Indexed keywords

ALGORITHMS; ENZYMES; GRAPH THEORY; HAMILTONIANS; POLYNOMIALS; PROBLEM SOLVING;

EID: 15944428540     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1568-4946(03)00012-7     Document Type: Article
Times cited : (14)

References (22)
  • 1
    • 0028114541 scopus 로고
    • Molecular computation of solutions to combinatorial problems
    • L. Adleman, Molecular computation of solutions to combinatorial problems, Science (1994) 1021-1024.
    • (1994) Science , pp. 1021-1024
    • Adleman, L.1
  • 3
    • 0032182186 scopus 로고    scopus 로고
    • DNA models and algorithms for NP-complete problems
    • E. Bach, A. Condon, DNA models and algorithms for NP-complete problems, J. Comput. Syst. Sci. 57 (1996) 172-186.
    • (1996) J. Comput. Syst. Sci. , vol.57 , pp. 172-186
    • Bach, E.1    Condon, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.