A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem

Yin Zhixiang; Sun Xia; Xu Feng; Fang Xianwen; Xu Hui

首页> 外文期刊>Journal of computational and theoretical nanoscience >A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem

【24h】

A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem

机译：最小生成树问题的三链DNA计算模型

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Single-strand DNA can match with homologous double-stranded into a triple-stranded structure mediated by RecA protein. The paper provides a triple-stranded DNA computing model for minimum spanning tree problem. DNA fragments corresponding to edges are coded by double-stranded DNA, wrong hybridization does not take place and hairpin structure does not form. The single-strand DNA probe is bond with RecA protein, so the rate of wrong solution will reduce. And in this way, encoding complexity and the errors in computation will be decreased.

机译：单链DNA可以与由RecA蛋白介导的同源双链匹配成三链结构。本文提供了用于最小生成树问题的三链DNA计算模型。对应于边缘的DNA片段由双链DNA编码，不会发生错误的杂交，也不会形成发夹结构。单链DNA探针与RecA蛋白结合，因此错误溶液的发生率将降低。并且以此方式，将减少编码复杂度和计算中的错误。

著录项

来源
《Journal of computational and theoretical nanoscience》 |2015年第7期|共6页
作者
Yin Zhixiang; Sun Xia; Xu Feng; Fang Xianwen; Xu Hui;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类薄膜技术;
关键词
Triple-Stranded DNA; Antigen Intermediary; Minimum Spanning Tree Problem;

机译：三链DNA抗原中介最小生成树问题;

相似文献

外文文献
中文文献
专利

1. A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem [J] . Yin Zhixiang, Sun Xia, Xu Feng, Journal of computational and theoretical nanoscience . 2015,第7期

机译：最小生成树问题的三链DNA计算模型
2. A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem by Using DNA Computing [J] . Majid Darehmiraki, Hasan Mishmast Nehi Research Journal of Biological Sciences . 2007,第6期

机译：DNA计算的度约束最小生成树问题并行算法
3. SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING [J] . Liu Xikui, Li Yan, Xu Jin Journal of Electronics (CHINA) . 2005,第2期

机译：用DNA计算解决最小扩展树问题
4. DNA Computing Model for the Minimum Spanning Tree Problem [C] . Aili Han, Daming Zhu International Symposium on Symbolic and Numeric Algorithms for Scientific Computing . 2007

机译：最低生成树问题的DNA计算模型
5. Computing a diameter-constrained minimum spanning tree. [D] . Abdalla, Ayman Mahmoud. 2001

机译：计算直径受限的最小生成树。
6. Disentangling age‐ and disease‐related alterations in schizophrenia brain network using structural equation modeling: A graph theoretical study based on minimum spanning tree [O] . Xinyu Liu, Hang Yang, Benjamin Becker, 2021

机译：利用结构方程模型解解精神分裂症和疾病相关的改变性脑脑网络：基于最小生成树的图形理论研究
7. The Minimum Spanning Tree Problem based on Triple-Stranded DNA Structure Model [O] . Jing Yang, Zhi-xiang Yin, Ming-qiang Chen, 2014

机译：基于三链DNa结构模型的最小生成树问题
8. Computing Minimum Spanning Trees on a Fat-Tree Architecture [R] . Maggs, B. M. 1985

机译：计算Fat-Tree架构上的最小生成树

A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem

摘要

著录项

相似文献

相关主题

期刊订阅