• DocumentCode
    2899979
  • Title

    An Algorithm of Sticker DNA Chip Model on Making Spanning Tree Problem

  • Author

    Zhou, Kang ; Tong, Xiao-jun ; Xu, Jin

  • Author_Institution
    Dept. of Control Sci. & Eng., Huazhong Univ. of Sci. & Technol., Wuhan
  • fYear
    2006
  • fDate
    13-16 Aug. 2006
  • Firstpage
    4287
  • Lastpage
    4292
  • Abstract
    In this paper, we set up sticker DNA chip model whose essential bio-chemical experiments and their realization of process are discussed. Then we put forward a DNA algorithm of making spanning tree problem and its bio-chemical implement process. The algorithm is first creating an original solution set of spanning subgraph then filtering the set to obtain all spanning trees. And then we prove the validity and complexity of the DNA algorithm, and explain feasibility of the DNA algorithm by an example. Finally, we can draw a conclusion that sticker DNA chip model possesses of predominance both of sticker model and DNA chip model
  • Keywords
    biochemistry; biocomputing; computational complexity; trees (mathematics); DNA algorithm complexity; biochemical implementation process; sticker DNA chip model; subgraph spanning; tree spanning problem; Application software; Cybernetics; DNA computing; Filtering algorithms; Fluorescence; Glass; Machine learning; Mathematical model; Mathematics; Molecular biophysics; NP-complete problem; Physics; Presence network agents; Probes; Temperature; Testing; A sticker DNA chip model; making spanning tree problem; marking experiment; memory complex;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2006 International Conference on
  • Conference_Location
    Dalian, China
  • Print_ISBN
    1-4244-0061-9
  • Type

    conf

  • DOI
    10.1109/ICMLC.2006.259014
  • Filename
    4028826