메뉴 건너뛰기




Volumn 51, Issue 20, 2006, Pages 2541-2549

A DNA computer model for solving vertex coloring problem

Author keywords

DNA computer; Encoding; Graph vertex coloring problem

Indexed keywords


EID: 33751543341     PISSN: 10016538     EISSN: 18619541     Source Type: Journal    
DOI: 10.1007/s11434-006-2145-6     Document Type: Article
Times cited : (26)

References (28)
  • 1
    • 0028114541 scopus 로고
    • Molecular computation of solution to combinatorial problems
    • Adleman L. Molecular computation of solution to combinatorial problems. Science, 1994, 66(11): 1021-1024
    • (1994) Science , vol.66 , Issue.11 , pp. 1021-1024
    • Adleman, L.1
  • 2
    • 0029278612 scopus 로고
    • DNA solution of hard computational problems
    • Lipton R J. DNA solution of hard computational problems. Science, 1995, 268(28): 542-545
    • (1995) Science , vol.268 , Issue.28 , pp. 542-545
    • Lipton, R.J.1
  • 4
    • 0037134023 scopus 로고    scopus 로고
    • Solution of a 20-variable 3-SAT problem on a DNA computer
    • Braich R S, Chelyapov N, Johnson C, et al. Solution of a 20-variable 3-SAT problem on a DNA computer. Science, 2002, 296(19): 499-502
    • (2002) Science , vol.296 , Issue.19 , pp. 499-502
    • Braich, R.S.1    Chelyapov, N.2    Johnson, C.3
  • 5
    • 0034685812 scopus 로고    scopus 로고
    • Molecular computation by DNA hairpin formation
    • Sakamoto K, Gouzu H, Komiya K, et al. Molecular computation by DNA hairpin formation. Science, 2000, 288: 1223-1226
    • (2000) Science , vol.288 , pp. 1223-1226
    • Sakamoto, K.1    Gouzu, H.2    Komiya, K.3
  • 6
    • 0030725521 scopus 로고    scopus 로고
    • DNA solution of the maximal clique problem
    • Ouyang Q, Kaplan P D, Liu S M, et al. DNA solution of the maximal clique problem. Science, 1997, 278(17): 446-449
    • (1997) Science , vol.278 , Issue.17 , pp. 446-449
    • Ouyang, Q.1    Kaplan, P.D.2    Liu, S.M.3
  • 7
    • 0034642536 scopus 로고    scopus 로고
    • DNA computing on surfaces
    • Liu Q H, Wang L M, Frutos A G, et al. DNA computing on surfaces. Nature, 2000, 403(13): 175-178
    • (2000) Nature , vol.403 , Issue.13 , pp. 175-178
    • Liu, Q.H.1    Wang, L.M.2    Frutos, A.G.3
  • 8
    • 2642555548 scopus 로고    scopus 로고
    • An autonomous molecular computer for logical control of gene expression
    • Benenson Y, Gil B, Ben-Dor U, et al. An autonomous molecular computer for logical control of gene expression. Nature, 2004, 429(27): 1-6
    • (2004) Nature , vol.429 , Issue.27 , pp. 1-6
    • Benenson, Y.1    Gil, B.2    Ben-Dor, U.3
  • 9
    • 0035936116 scopus 로고    scopus 로고
    • Programmable and autonomous computingmachine made of biomolecules
    • Benenson Y, Paz-Elizur T, Adar R, et al. Programmable and autonomous computingmachine made of biomolecules. Nature, 2001, 414(22): 430-434
    • (2001) Nature , vol.414 , Issue.22 , pp. 430-434
    • Benenson, Y.1    Paz-Elizur, T.2    Adar, R.3
  • 11
    • 0004142841 scopus 로고
    • Cambridge, London, New York: Cambridge University Press
    • Gibbons A. Algorithmic Graph Theory. Cambridge, London, New York: Cambridge University Press, 1985
    • (1985) Algorithmic Graph Theory
    • Gibbons, A.1
  • 12
    • 0003698173 scopus 로고
    • New York/Singapore: A Wiley-Interscience Publication, John Wiley & Sons
    • Jensen T R, Toft B. Graph Coloring Problems. New York/Singapore: A Wiley-Interscience Publication, John Wiley & Sons, 1995
    • (1995) Graph Coloring Problems
    • Jensen, T.R.1    Toft, B.2
  • 13
    • 0000409644 scopus 로고
    • A technique for coloring a graph applicable to large-scale optimization problems
    • Wood D C. A technique for coloring a graph applicable to large-scale optimization problems. Comput J, 1969, 12: 317
    • (1969) Comput J , vol.12 , pp. 317
    • Wood, D.C.1
  • 14
    • 0032028848 scopus 로고    scopus 로고
    • Approximate graph coloring by semidefinite programming
    • Karger D, Motwani R, Sudan M. Approximate graph coloring by semidefinite programming. Journal of ACM, 1998, 45(2): 246-265
    • (1998) Journal of ACM , vol.45 , Issue.2 , pp. 246-265
    • Karger, D.1    Motwani, R.2    Sudan, M.3
  • 15
    • 0027201216 scopus 로고
    • A still better performance guarantee for approximate graph coloring
    • Halldorsson M M. A still better performance guarantee for approximate graph coloring. Inf Proc Lett , 1994, 45: 19-23
    • (1994) Inf Proc Lett , vol.45 , pp. 19-23
    • Halldorsson, M.M.1
  • 16
    • 33751522732 scopus 로고    scopus 로고
    • Neural network and graph theory
    • Xu Jin, Bao Zheng. Neural network and graph theory. Sci China Ser F-Inf Sci, 2002, 45(1): 1-24
    • (2002) Sci China Ser F-Inf Sci , vol.45 , Issue.1 , pp. 1-24
    • Jin, X.1    Zheng, B.2
  • 19
    • 0038802670 scopus 로고    scopus 로고
    • Study on the plan of using shunting locomotives based on Simulated Annealing Algorithm and Graph Coloring
    • Xu Jie, Du Wen, Li Zongping, et al. Study on the plan of using shunting locomotives based on Simulated Annealing Algorithm and Graph Coloring. Journal of The China Railway Society, 2003, 25(3): 24-30
    • (2003) Journal of the China Railway Society , vol.25 , Issue.3 , pp. 24-30
    • Jie, X.1    Wen, D.2    Zongping, L.3
  • 20
    • 0036557843 scopus 로고    scopus 로고
    • DNA solution of a graph coloring problem
    • Liu Yachun, Xu Jin, Pan Linqiang, et al. DNA solution of a graph coloring problem. J Chem Inf Comput Sc, 2002, 42(3): 524-528
    • (2002) J Chem Inf Comput Sc , vol.42 , Issue.3 , pp. 524-528
    • Yachun, L.1    Jin, X.2    Linqiang, P.3
  • 21
    • 0036708523 scopus 로고    scopus 로고
    • A DNA algorithm for the graph coloring problem
    • Liu Wenbin, Xu Jin. A DNA algorithm for the graph coloring problem. J Chem Inf Comput, 2002, 42: 1176-1178
    • (2002) J Chem Inf Comput , vol.42 , pp. 1176-1178
    • Wenbin, L.1    Jin, X.2
  • 22
    • 0041525545 scopus 로고    scopus 로고
    • A DNA algorithm for graph vertex coloring problem
    • Gao Lin, Xu Jin. A DNA algorithm for graph vertex coloring problem. Acta Electronic Sinica, 2003, 31(4): 494-496
    • (2003) Acta Electronic Sinica , vol.31 , Issue.4 , pp. 494-496
    • Lin, G.1    Jin, X.2
  • 25
    • 33751510787 scopus 로고    scopus 로고
    • DNA Computer Principle, Advances and Difficulties (II): Formation of Data Base-DNA Synthesis
    • Xu Jin, Huang Buyi. DNA Computer Principle, Advances and Difficulties (II): Formation of Data Base-DNA Synthesis. Chin J Comput, 2005, 28(10): 1-9
    • (2005) Chin J Comput , vol.28 , Issue.10 , pp. 1-9
    • Jin, X.1    Buyi, H.2
  • 26
    • 0004270170 scopus 로고    scopus 로고
    • Beijing: Chinese Academy of Medical Science & Peking Union Medical College Press
    • Lu Shengdong. Current Protocols in Molecular Biology. Beijing: Chinese Academy of Medical Science & Peking Union Medical College Press, 1999. 9
    • (1999) Current Protocols in Molecular Biology , pp. 9
    • Shengdong, L.1
  • 27
    • 13944261250 scopus 로고    scopus 로고
    • Design of nucleic acid sequences for DNA computing based on a thermodynamic approach
    • Fumiaki Tanaka, Atsushi Kameda, Masahito Yamamoto. Design of nucleic acid sequences for DNA computing based on a thermodynamic approach. Nucleic Acids Res, 2005, 33(3): 903-911
    • (2005) Nucleic Acids Res , vol.33 , Issue.3 , pp. 903-911
    • Tanaka, F.1    Kameda, A.2    Yamamoto, M.3
  • 28
    • 4344687512 scopus 로고    scopus 로고
    • Codeword design and information encoding in DNA ensemble
    • Garzon M, Deaton R J. Codeword design and information encoding in DNA ensemble. Nat Comput, 2004, 3: 253-292
    • (2004) Nat Comput , vol.3 , pp. 253-292
    • Garzon, M.1    Deaton, R.J.2


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