@article{MaZi09,
author = {Israel Marck Martinez-Perez and Karl-Heinz Zimmermann},
title = {Parallel bioinspired algorithms for NP complete graph problems.},
journal = {Journal of Parallel and Distributed Computing (JPDC).},
year = {2009},
volume = {69.},
number = {(3),},
pages = {221-229},
month = {March},
note = {khzimmermann, AEG},
publisher = {Elsevier:},
isbn = {10.1016/j.jpdc.2008.06.014},
howpublished = {09-85 MaZi09 JPDC},
abstract = {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.}
}

@COMMENT{Bibtex file generated on 2026-6-28 with typo3 si_bibtex plugin. Data from https://www.tuhh.de/es/de/home/publications }