| [176947] |
| Title: Bioinspired Parallel Algorithms for Maximum Clique Problem on FPGA Architectures. |
| Written by: Israel Marck Martinez-Perez, Wolfgang Brandt, Michael Wild and Karl-Heinz Zimmermann |
| in: <em>Journal of Signal Processing Systems</em>. February (2010). |
| Volume: <strong>58</strong>. Number: (2), |
| on pages: 117-124 |
| Chapter: |
| Editor: |
| Publisher: Springer: |
| Series: |
| Address: |
| Edition: |
| ISBN: 10.1007/s11265-008-0322-3 |
| how published: 10-80 MBWZ10 JSPS |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: wbrandt, khzimmermann, AEG
Abstract: The stickers model is a model of DNA computation that is computationally complete and universal. Many NP complete problems can be described by stickers programs that have polynomial runtime and are exponential in space. The stickers model can be viewed as a bit-vertically operating register machine. This makes it attractive for in silico implementation. This paper describes a stickers model for the maximum clique problem and its implementation by an FPGA architecture. The results show that the FPGA based algorithm is comparable with existing software algorithms for moderate problem sizes. More generally, the stickers model seems to be a well-suited programming model for dedicated hardware.