• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Lan Wenfei, Xing Zhibao, Huang Jun, Qiang Xiaoli. The DNA Self-Assembly Computing Model for Solving Perfect Matching Problem of Bipartite Graph[J]. Journal of Computer Research and Development, 2016, 53(11): 2583-2593. DOI: 10.7544/issn1000-1239.2016.20150312
Citation: Lan Wenfei, Xing Zhibao, Huang Jun, Qiang Xiaoli. The DNA Self-Assembly Computing Model for Solving Perfect Matching Problem of Bipartite Graph[J]. Journal of Computer Research and Development, 2016, 53(11): 2583-2593. DOI: 10.7544/issn1000-1239.2016.20150312

The DNA Self-Assembly Computing Model for Solving Perfect Matching Problem of Bipartite Graph

More Information
  • Published Date: October 31, 2016
  • Biological systems are far more complex and robust than systems we can engineer today, and Because of its advantages of stability and specificity, DNA molecules have been used for the construction of nano-scale structures. With the development of DNA molecule self-assembly strategy, lots of programmable DNA tiles are constructed and used for solving NP problems. The tile assembly model, a formal model of crystal growth, is a highly distributed parallel model of natures self-assembly with the traits of highly distributed parallel, massive storage density and low power consumption. In the system, a function can be computed by deterministic assembly and identified two important quantities: the number of tile types and the assembly speed of the computation. Here a DNA self-assembly model for perfect matching problem of bipartite graph is demonstrated, and a 10-vertices bipartite graph is used as an example to illustrate this model. The computation is nondeterministic and each parallel assembly is executed in time linear in the input. The result shows that the successful solutions can be found among the many parallel assemblies, and it requires only a constant number of different tile types: 14.
  • Related Articles

    [1]Liu Song, Wu Weiguo, Zhao Bo, Jiang Qing. Loop Tiling for Optimization of Locality and Parallelism[J]. Journal of Computer Research and Development, 2015, 52(5): 1160-1176. DOI: 10.7544/issn1000-1239.2015.20131387
    [2]Zhou Xu, Zhou Yantao, Ouyang Aijia, Li Kenli. An Efficient Tile Assembly Model for Maximum Clique Problem[J]. Journal of Computer Research and Development, 2014, 51(6): 1253-1262.
    [3]Li Kenli, Luo Xing, Wu Fan, Zhou Xu, and Huang Xin. An Algorithm in Tile Assembly Model for Maximum Clique Problem[J]. Journal of Computer Research and Development, 2013, 50(3): 666-675.
    [4]Zhou Xu, Li Kenli, Yue Guangxue, Yang Zhibang. A Volume Molecular Solution for the Maximum Matching Problem on DNA-Based Computing[J]. Journal of Computer Research and Development, 2011, 48(11): 2147-2154.
    [5]Li Kenli, Guo Li, Tang Zhuo, Jiang Yong, and Li Renfa. A Molecular Solution for the Ramsey Number on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2011, 48(3): 447-454.
    [6]Xu Guang, An Hong, Xu Mu, Liu Gu, Yao Ping, Ren Yongqing, and Wang Fang. The Architecture and the Programming Model of a Data-Flow-Like Driven Tiled Stream Processor[J]. Journal of Computer Research and Development, 2010, 47(9): 1643-1653.
    [7]Li Kenli, Yao Fengjuan, Li Renfa, Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2007, 44(6): 1063-1070.
    [8]Han Aili, Zhu Daming. DNA Computing Model Based on a New Scheme of Encoding Weight for Chinese Postman Problem[J]. Journal of Computer Research and Development, 2007, 44(6): 1053-1062.
    [9]Wang Lei, Lin Yaping, and Li Zhiyong. DNA Computation for a Category of Special Integer Planning Problem[J]. Journal of Computer Research and Development, 2005, 42(8): 1431-1437.
    [10]Chen Zhiping, Li Xiaolong, Wang Lei, Lin Yaping, and Cai Lijun. A Surface-Based DNA Algorithm for the Perfect Matching Problem[J]. Journal of Computer Research and Development, 2005, 42(7): 1241-1246.

Catalog

    Article views (1158) PDF downloads (564) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return