A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
From MaRDI portal
Publication:2479238
DOI10.1016/j.amc.2007.08.005zbMath1171.68009OpenAlexW2071860466MaRDI QIDQ2479238
Publication date: 26 March 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.08.005
NP-completemolecular computingDNA-based computingbiological operationsDNA-based algorithmsdata engineering applications on bioinformaticsthe graph isomorphism problem
Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
A computational DNA solution approach for the quadratic Diophantine equation, The domination numbers of cylindrical grid graphs, A DNA sticker algorithm for bit-substitution in a block cipher, Parallel DNA arithmetic operation based on \(n\)-moduli set, A polynomial-time DNA computing solution for the bin-packing problem
Cites Work