A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation

Published:2013-10 Issue:1 Volume:114 Page:1-7
ISSN:0303-2647
Container-title:Biosystems
language:en
Short-container-title:Biosystems

Author:

Wang Zhaocai,Huang Dongmei,Meng Huajun,Tang Chengpei

Funder

Doctor fund of Shanghai Ocean University

Shanghai Ocean university 085 Engineering

CNSF

Specialized Research Fund for the Doctoral Program of Higher Education

Publisher

Elsevier BV

Subject

Applied Mathematics,General Biochemistry, Genetics and Molecular Biology,Modelling and Simulation,General Medicine,Statistics and Probability

Reference36 articles.

1. Molecular computation of solution to combinatorial problems;Adleman;Science,1994

2. A polynomial-time DNA computing solution for the Bin-Packing Problem;Alonso Sanches;Appl. Math. Comput.,2009

3. DNA approach to solve clustering problem based on a mutual order;Bakar;Biosystems,2008

4. Murty USR. Graph Theory with Applications;Bondy,1976

5. Solution of a satisfiability problem on a gel-based DNA computer, in: Proceedings of the Sixth International Conference on DNA Computation (DNA 2000);Braich;Lecture Notes in Computer Science,2001

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem;IEEE Transactions on NanoBioscience;2024-07

2. Automatic segmentation of layers in chorio-retinal complex using Graph-based method for ultra-speed 1.7 MHz wide field swept source FDML optical coherence tomography;Medical & Biological Engineering & Computing;2024-01-09

3. A parallel algorithm to solve the multiple travelling salesmen problem based on molecular computing model;International Journal of Bio-Inspired Computation;2022

4. A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity;Journal of Intelligent & Fuzzy Systems;2021-03-02

5. Fundamental Boolean network modelling for childhood acute lymphoblastic leukaemia pathways;Quantitative Biology;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3