Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
DNA models and algorithms for NP-complete problems
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Volume bounded molecular computation
Volume bounded molecular computation
Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing
Parallel Computing - Special issue: High-performance parallel bio-computing
Biomolecular autonomous solution of the Hamiltonian path problem via hairpin formation
International Journal of Bioinformatics Research and Applications
Efficient initial pool generation for weighted graph problems using parallel overlap assembly
DNA'04 Proceedings of the 10th international conference on DNA computing
| Hi-index | 0.00 |
It is no longer believed that DNA computing will outperform digital computers when it comes to the computation of intractable problems. In this paper, we emphasise the in silico implementation of DNA-inspired algorithms as the only way to compete with other algorithms for solving NP-complete problems. For this, we provide sticker algorithms for some of the most representative NP-complete graph problems. The simple data structures and bit-vertical operations make them suitable for some parallel architectures. The parallel algorithms might solve either moderate-size problems in an exact manner or, when combined with a heuristic, large problems in polynomial time.