Using sticker to solve the 3-dimensional matching problem in molecular supercomputers

DOI10.1504/IJHPCN.2004.007572zbMath1171.68477OpenAlexW1995990573MaRDI QIDQ3549251

Jiannong Cao, Minyi Guo, Weng-Long Chang

Publication date: 21 December 2008

Published in: International Journal of High Performance Computing and Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijhpcn.2004.007572

zbMATH Keywords

simulationparallel computinghigh performance computingthree-dimensional matchingNP-complete satisfiability3D matchingDNA-based parallel algorithmsmolecular supercomputingNP-complete Hamiltonian path problemsticker

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A DNA-based graph encoding scheme with its applications to graph isomorphism problems

This page was built for publication: Using sticker to solve the 3-dimensional matching problem in molecular supercomputers