Skip to main content
SpringerLink
Log in

Antibody-based computing

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

An application of the antibody’s flexible recognition (i.e. multi-reactivity) to antigenic epitopes to a combinatorial computing is just getting started. The present study discusses an antibody-based computation algorithm to solve a combinatorial problem: the stable marriage problem. The stable marriage problem supposes n men and n women, and each person ranks all members of the opposite sex in a strict order of preference. Under given preference lists, to detect all of “stable” n couples including no affair pairs means to solve this problem. Our algorithm replaces a man and a woman with an antigenic epitope and an antibody respectively, and re-scales a man (woman)’s preference to a woman (man) as strength of a binding affinity between an epitope to the man and an antibody to the woman. Under these settings, we demonstrate a parallel progression of immune reactions can solve the stable marriage problem.

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

Similar content being viewed by others

References

  1. Adleman LM (2004) Molecular computation of solutions to combinatorial problems. Science 26611:1021–1024

    Google Scholar 

  2. Gusfield D, Irving RW (1989) The stable marriage problem, The MIT Press

  3. Smith DJ, Forrest S, Hightower RR, et al (1997) Deriving shape space parameters from immunological data. J Theor Biol 1892:141–150

    Article  Google Scholar 

  4. Ishida Y (2008) An antibody-based computing: an application to stable marriage problem. Artif Life Robotics 12:125–128

    Article  Google Scholar 

  5. Balan MS, Krithivasan K, Sivasubramanyam Y (2002) Peptide computing - Universality and complexity. In: Proc DNA7, LNCS 2340, pp 290–299

  6. Balan MS, Krithivasan K (2004) Parallel computation of simple arithmetic using peptide-antibody interactions. Bio Systems 76:303–307

    Google Scholar 

  7. Moody MD, Van Arsdell SW, Murphy KP, et al (2001) Array-based ELISAs for high-throughput analysis of human cytokines. Biotechniques 311:186–190, 192–194

    Google Scholar 

  8. Gershon D (2003) Proteomics technologies: probing the proteome. Nature 424:581–587

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Toyohashi University of Technology, 1-1 Tempaku, Toyohashi, Aichi, 441-8585, Japan

    Kouji Harada & Yoshiteru Ishida

Authors
  1. Kouji Harada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshiteru Ishida
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kouji Harada.

Additional information

This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008

About this article

Cite this article

Harada, K., Ishida, Y. Antibody-based computing. Artif Life Robotics 13, 180–183 (2008). https://doi.org/10.1007/s10015-008-0580-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-008-0580-y

Key words

Search

Navigation