메뉴 건너뛰기




Volumn 31, Issue 4, 2003, Pages 494-497

DMA algorithm for graph vertex coloring problem

Author keywords

DNA computation; Endonucleases; NP complete problem; Vertex coloring problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DNA; OPTIMIZATION;

EID: 0041525545     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (20)

References (17)
  • 1
    • 0028114541 scopus 로고
    • Molecular computation of solution to combinatorial problems
    • I, Adleman. Molecular Computation of Solution to Combinatorial problems [J]. Science, 1994, 266(11): 1021-1024.
    • (1994) Science , vol.266 , Issue.11 , pp. 1021-1024
    • Adleman, I.1
  • 3
    • 0004142841 scopus 로고
    • Cambridge University Press, London: Cambridge
    • A Gibbons. Algorithmic graph Theory, Cambridge University press [M]. London: Cambridge, 1985.
    • (1985) Algorithmic Graph Theory
    • Gibbons, A.1
  • 4
    • 0029278612 scopus 로고
    • DNA solution of computation problems
    • Richard J Lipton. DNA Solution of Computation Problems [J]. Science, 1995, 268(4): 542-545.
    • (1995) Science , vol.268 , Issue.4 , pp. 542-545
    • Lipton, R.J.1
  • 5
    • 0034642536 scopus 로고    scopus 로고
    • DNA computing on surface
    • Qinghua Liu, et al. DNA Computing on Surface [J]. Nature, 2000, 403(13): 175-179.
    • (2000) Nature , vol.403 , Issue.13 , pp. 175-179
    • Liu, Q.1
  • 6
    • 0030725521 scopus 로고    scopus 로고
    • Solution of the maximal clique problem
    • Q Ouyang, et al. Solution of the Maximal Clique Problem [J]. Science, 1997, 278(17): 446-449.
    • (1997) Science , vol.278 , Issue.17 , pp. 446-449
    • Ouyang, Q.1
  • 7
    • 0034233178 scopus 로고    scopus 로고
    • Computing with DNA by operating on plasmids
    • T Head, et al. Computing with DNA by Operating on Plasmids [J]. Biosystem, 2000, 57: 87-93.
    • (2000) Biosystem , vol.57 , pp. 87-93
    • Head, T.1
  • 8
    • 0012300441 scopus 로고    scopus 로고
    • A sticker based models for DNA computation
    • S Rowise, et al. A sticker Based models for DNA computation [EB/OL]. http://www.coininfo.chem.wisc.edu.
    • Rowise, S.1
  • 9
    • 0042282945 scopus 로고    scopus 로고
    • Chinese source
  • 10
    • 0043285192 scopus 로고    scopus 로고
    • Chinese source
  • 12
    • 0043285190 scopus 로고    scopus 로고
    • Chinese source
  • 13
    • 0003958521 scopus 로고
    • On the computation power of DNA
    • USA: Prinecton University
    • D Boneh, et al. On the Computation Power of DNA [R]. USA: Prinecton University, 1995.
    • (1995)
    • Boneh, D.1
  • 14
    • 0001172709 scopus 로고    scopus 로고
    • Biomolecular computing and programming
    • M H Garzon, et al. Biomolecular Computing and Programming [J]. IEEE Trans. On Evolutionary Computation, 1999, 3(3): 236-250.
    • (1999) IEEE Trans. on Evolutionary Computation , vol.3 , Issue.3 , pp. 236-250
    • Garzon, M.H.1
  • 15
    • 0032703094 scopus 로고    scopus 로고
    • The bounded complexity of DNA computing
    • H Garzon. The Bounded Complexity of DNA Computing [J]. Biosystems, 1999, 52: 63-72.
    • (1999) Biosystems , vol.52 , pp. 63-72
    • Garzon, H.1
  • 17
    • 0000905816 scopus 로고
    • An improved DNA encoding scheme for neural network modeling, world congress on neural networks san diego
    • USA: CA
    • Russo M F, et al. An Improved DNA Encoding Scheme for Neural Network Modeling, World Congress on Neural networks San diego [A]. 1994 International Neural networks Society Annual Meeting [C]. USA: CA, 1994. 354-359.
    • (1994) 1994 International Neural networks Society Annual Meeting , pp. 354-359
    • Russo, M.F.1


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