The computing model for minimal covering problem based on three-dimensional DNA walker

zbMATH Open1463.68027MaRDI QIDQ3385752FDOQ3385752

Authors: Xin-yue Zhao, Zhixiang Yin 

Publication date: 14 January 2021

Recommendations

• A novel DNA computing model based on RecA-mediated triple-stranded DNA structure
• scientific article; zbMATH DE number 5262968
• A surface-based DNA algorithm for the minimal vertex cover problem
• New algorithms for some NP-optimization problems by DNA computing
• scientific article; zbMATH DE number 1342105

zbMATH Keywords

DNA walkerG-quadruplex structureminimal covering problem

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cited In (1)

• A Realization of DNA Molecular Machine That Walks Autonomously by Using a Restriction Enzyme

This page was built for publication: The computing model for minimal covering problem based on three-dimensional DNA walker

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