Skip to main content
SpringerLink
Log in

Bioinspired Parallel Algorithms for Maximum Clique Problem on FPGA Architectures

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6

Similar content being viewed by others

References

  1. Adleman, L. (1994). Molecular computation of solutions of combinatorial problems. Science 266, 1021–1023.

    Article  Google Scholar 

  2. Garey, M. R., & Johnson D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman.

    MATH  Google Scholar 

  3. Ignatova, Z., Martinez-Perez, I., & Zimmermann, K.-H. (2008). DNA computing models. Boston: Springer.

    MATH  Google Scholar 

  4. Kilts, S. (2007). Advanced FPGA design: Architecture, implementation, and optimization. New York: Wiley-IEEE.

    Google Scholar 

  5. Kendrew, J. (1998). Encyclopedia of molecular biology. Oxford: Blackwell.

    Google Scholar 

  6. Martinez-Perez, I. (2007). Biomolecular computing models for graph problems and finite state automata. Ph.D. thesis, Hamburg Univ Tech.

  7. Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N., Goodman, M., Rothemund P., et al. (1996). A sticker based architecture for DNA computation. In E. B. Baum (Ed.), DNA based computers (pp. 1–27). Providence: AMS.

    Google Scholar 

  8. XILINX (2008). Virtex-4 FPGA user guide. http://www.xilinx.com/support/documentation/user_guides/ug070.pdf.

  9. Zimmermann, K.-H. (2002). On applying molecular computation to binary linear codes. IEEE Transactions on Information Theory, 48, 505–510.

    Article  MATH  Google Scholar 

  10. Zimmermann, K.-H. (2002). Efficient DNA sticker algorithms for NP-complete graph problems. Computer Physics Communications, 114, 297–309.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Technology, Hamburg University of Technology, 21071, Hamburg, Germany

    Israel Martínez-Pérez, Wolfgang Brandt, Michael Wild & Karl-Heinz Zimmermann

Authors
  1. Israel Martínez-Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Brandt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Wild
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Karl-Heinz Zimmermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Karl-Heinz Zimmermann.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martínez-Pérez, I., Brandt, W., Wild, M. et al. Bioinspired Parallel Algorithms for Maximum Clique Problem on FPGA Architectures. J Sign Process Syst Sign Image Video Technol 58, 117–124 (2010). https://doi.org/10.1007/s11265-008-0322-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-008-0322-3

Keywords

Search

Navigation