1996
DOI: 10.1006/jtbi.1996.0231
|View full text |Cite
|
Sign up to set email alerts
|

Size and Connectivity of the Idiotypic Network Are Independent of the Discreteness of the Affinity Distribution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
32
0
1

Year Published

1997
1997
2004
2004

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 25 publications
(33 citation statements)
references
References 0 publications
0
32
0
1
Order By: Relevance
“…General immune system models that include clones with receptors have been simulated with the order of 10 3 clones (DeBoer & Perelson, 1991;Celada & Seiden, 1996;Detours et al, 1996). Lattice based cellular models that use only one or two bits to represent the concentration of highly simplified clones, and measure affinity by neighborhood on the lattice, have simulated 10 4 clones (DeBoer et al, 1992a), and 10 8 clones (Stauffer & Sahimi, 1994) (the latter on a Cray-YMP).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…General immune system models that include clones with receptors have been simulated with the order of 10 3 clones (DeBoer & Perelson, 1991;Celada & Seiden, 1996;Detours et al, 1996). Lattice based cellular models that use only one or two bits to represent the concentration of highly simplified clones, and measure affinity by neighborhood on the lattice, have simulated 10 4 clones (DeBoer et al, 1992a), and 10 8 clones (Stauffer & Sahimi, 1994) (the latter on a Cray-YMP).…”
Section: Discussionmentioning
confidence: 99%
“…Seiden & Celada (1992), Forrest & Perelson (1991), and Perelson et al (1996) (after Farmer et al (1986)), represented molecules as strings of 8, 32, and 64 bits respectively and measured affinity as a function of the Hamming distance 3 (or a variation on it) between them. Weisbuch & Oprea (1994) and Detours et al (1996) represented molecules as strings of digits chosen from a 4 and 16 letter alphabet respectively. Smith et al (1997b) determined that representing molecules as strings of 20 symbols, with each symbol chosen from a 4 letter alphabet, and affinity measured as a function of Hamming distance, as well as using a realistic-size repertoire of 10 7 B cell clones, gave good fits to immunological data important for a model of cross-reactive memory.…”
Section: Introductionmentioning
confidence: 99%
“…For the matching algorithm we used both the hamming and adjacency matches, and found similar results. The 'hamming match' between two bit strings equals the sum of all complementary bits, and the 'adjacency match' equals the longest block of adjacent complementary bits (figure 1; De Boer & Perelson 1991;Detours et al 1996). Here, we only present the results obtained with the adjacency match, because it embodies the nonlinear nature of the T-cell MHC-peptide interaction better than the hamming match does.…”
Section: Models For T-cell Tolerance Inductionmentioning
confidence: 99%
“…e-mail: asp@lanl.gov. (66). Affinity, K, is the sum of interaction strengths of contacting digits in aligned strings.…”
Section: Modelmentioning
confidence: 99%