Making all spanning tree problem based on sticker model

DOI10.1016/J.MATCOM.2017.04.002zbMath1482.92058OpenAlexW2604474756MaRDI QIDQ1997053

Zhen Cheng, Yufang Huang, Yafei Dong, Kang Zhou

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

sticker modelcomplete hybridization of incomplete separationdetection experiment based on separation technologymaking all spanning tree problem

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20)

Cites Work

• Unnamed Item
• Unnamed Item
• A DNA procedure for solving the shortest path problem
• DNA computing, sticker systems, and universality
• Sticker systems
• Efficient DNA sticker algorithms for NP-complete graph problems

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