메뉴 건너뛰기




Volumn 2340, Issue , 2002, Pages 203-212

Solutions of shortest path problems by concentration control

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMBINATORIAL OPTIMIZATION; DNA;

EID: 84944906007     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48017-x_19     Document Type: Conference Paper
Times cited : (13)

References (8)
  • 1
    • 0028114541 scopus 로고
    • Molecular Computation of Solutions to Combinatorial Problems
    • L. Adleman: “Molecular Computation of Solutions to Combinatorial Problems,” Science, vol. 266, pp. 1021–1024, 1994.
    • (1994) Science , vol.266 , pp. 1021-1024
    • Adleman, L.1
  • 2
    • 0029278612 scopus 로고
    • DNA Solution of Hard Computational Problems
    • R. J. Lipton: “DNA Solution of Hard Computational Problems,” Science, vol. 268, pp. 542–545, 1995.
    • (1995) Science , vol.268 , pp. 542-545
    • Lipton, R.J.1
  • 3
    • 0030725521 scopus 로고    scopus 로고
    • DNA Solution of the Maximal Clique Problem
    • Q. Ouyang, P. Kaplan, S. Lir, and A. Libchaber: “DNA Solution of the Maximal Clique Problem,” Science, vol. 278, pp. 446–449, 1997.
    • (1997) Science , vol.278 , pp. 446-449
    • Ouyang, Q.1    Kaplan, P.2    Lir, S.3    Libchaber, A.4
  • 6
    • 4344588263 scopus 로고    scopus 로고
    • Aqueous Computing: Writing on molecules
    • IEEE Service Center, Piscataway NJ
    • T. Head, M. Yamamura, and S. Gal: “Aqueous Computing: writing on molecules,” Proc. Congress on Evolutionary Computation 1999, IEEE Service Center, Piscataway NJ, pp. 1006–1010, 1999.
    • (1999) Proc. Congress on Evolutionary Computation 1999 , pp. 1006-1010
    • Head, T.1    Yamamura, M.2    Gal, S.3


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