Making all spanning tree problem based on sticker model

DOI10.1016/J.MATCOM.2017.04.002MaRDI QIDQ1997053zbMATH OpenOpenAlexFDO

Authors Kang Zhou, Yufang Huang, Zhen Cheng, Yafei Dong

Publication date 1 March 2021

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.matcom.2017.04.002

zbMATH Keywords

complete hybridization of incomplete separationdetection experiment based on separation technologymaking all spanning tree problemsticker model

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20)

Recommendations

• A sticker model-based DNA algorithm of maximum clique problem
• Sticker DNA computer model. II: Application
• A batch separation experiment-based DNA algorithm of the maximum independent set problem
• Efficient DNA sticker algorithms for NP-complete graph problems
• DNA algorithm of map coloring problem based on sticker model

Cites work

• A DNA procedure for solving the shortest path problem
• Algorithm of DNA computing on optimal assignment problems
• Closed circle DNA algorithm of shortest path problems
• DNA computing, sticker systems, and universality
• Efficient DNA sticker algorithms for NP-complete graph problems
• Sticker systems

Cited in

(4)

• A batch separation experiment-based DNA algorithm of the maximum independent set problem
• A sticker model-based DNA algorithm of maximum clique problem
• DNA algorithm of map coloring problem based on sticker model
• A massively parallel algorithm based on DNA computations for constructing minimal spanning trees

This page was built for publication: Making all spanning tree problem based on sticker model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1997053)