Using lazy evaluation to simulate realistic-size repertoires in models of the immune system

We describe a method of implementing efficient computer simulations of immune systems that have a large number of unique B-and/or T-cell clones. The method uses an implementation technique called lazy evaluation to create the illusion that all clones are being simulated, while only actually simulating a much smaller number of clones that can respond to the antigens in the simulation. The method is effective because only 0.001–0.01% of clones can typically be stimulated by an antigen, and because many simulations involve only a small number of distinct antigens. A lazy simulation of a realistic number of clones and 10 distinct antigens is 1000 times faster and 10 000 times smaller than a conventional simulation—making simulations of immune systems with realistic-size repertoires computationally tractable.

[1]  A S Perelson,et al.  Evolution and somatic learning in V-region genes. , 1996, Research in immunology.

[2]  Derek J. Smith,et al.  Immunological Memory is Associative , 1998 .

[3]  S. Forrest,et al.  Modeling the effects of prior infection on vaccine efficacy , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[4]  Simon M. Lucas Rapid best-first retrieval from massive dictionaries by lazy evaluation of a syntactic neural network , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[5]  N. K. Jerne,et al.  Clonal selection in a lymphocyte network. , 1974, Society of General Physiologists series.

[6]  A. Perelson,et al.  Size and connectivity of the idiotypic network are independent of the discreteness of the affinity distribution. , 1996, Journal of theoretical biology.

[7]  G Köhler,et al.  Frequency of precursor cells against the enzyme β‐galactosidase An estimate of the BALB/c strain antibody repertoire , 1976, European journal of immunology.

[8]  P Leder,et al.  The genetics of antibody diversity. , 1982, Scientific American.

[9]  I. Aleksander,et al.  WISARD·a radical step forward in image recognition , 1984 .

[10]  G. Oster,et al.  Theoretical studies of clonal selection: minimal antibody repertoire size and reliability of self-non-self discrimination. , 1979, Journal of theoretical biology.

[11]  Franco Celada,et al.  Affinity maturation and hypermutation in a simulation of the humoral immune response , 1996, European journal of immunology.

[12]  D. Marr A theory of cerebellar cortex , 1969, The Journal of physiology.

[13]  Alan S. Perelson,et al.  Genetic Algorithms and the Immune System , 1990, PPSN.

[14]  James S. Albus,et al.  Brains, behavior, and robotics , 1981 .

[15]  Edelman Gm Origins and mechanisms of specificity in clonal selection. , 1974 .

[16]  S K Pierce,et al.  The interplay of evolution and environment in B-cell diversification. , 1977, Cold Spring Harbor symposia on quantitative biology.

[17]  Daniel P. Friedman,et al.  CONS Should Not Evaluate its Arguments , 1976, ICALP.

[18]  G M Edelman,et al.  Origins and mechanisms of specificity in clonal selection. , 1974, Society of General Physiologists series.

[19]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[20]  Douglas G. Danforth Total recall in distributive associative memories , 1991 .

[21]  A. Perelson,et al.  Size and connectivity as emergent properties of a developing immune network. , 1991, Journal of theoretical biology.

[22]  Louis A. Jaeckel A class of designs for a sparse distributed memory , 1989 .

[23]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[24]  Alan S. Perelson,et al.  Deriving Shape Space Parameters from Immunological Data for a Model of Cross-Reactive Memory , 1997 .

[25]  A S Perelson,et al.  Pattern formation in one- and two-dimensional shape-space models of the immune system. , 1992, Journal of theoretical biology.

[26]  Paul E. Dunne,et al.  Sequential and parallel strategies for the demand-driven simulation of logic circuits , 1993, Microprocess. Microprogramming.

[27]  P E Seiden,et al.  A model for simulating cognate recognition and response in the immune system. , 1992, Journal of theoretical biology.

[28]  Ron R. Hightower,et al.  Deriving shape space parameters from immunological data. , 1997, Journal of theoretical biology.

[29]  Pentti Kanerva,et al.  Sparse Distributed Memory , 1988 .

[30]  Max Samter,et al.  Antigens, Lymphoid Cells, and the Immune Response , 1971 .

[31]  Paul Hudak,et al.  Functional reactive animation , 1997, ICFP '97.

[32]  G. Weisbuch,et al.  Capacity of a model immune network. , 1994, Bulletin of mathematical biology.

[33]  D Stauffer,et al.  High-dimensional simulation of simple immunological models. , 1994, Journal of theoretical biology.

[34]  Peter Henderson,et al.  A lazy evaluator , 1976, POPL.

[35]  Louis A. Jaeckel An alternative design for a sparse distributed memory , 1989 .

[36]  Alan S. Perelson,et al.  Growth and Recruitment in the Immune Network , 1992 .

[37]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[38]  Alan S. Perelson,et al.  The immune system, adaptation, and machine learning , 1986 .