Revisiting Idiotypic Immune Networks
Revisiting Idiotypic Immune Networks
复制标题
重新审视独特型免疫网络
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
H. Bersini
中科院分区：
文献类型：
--
作者：
H. Bersini
本文将总结免疫独特型网络模拟背后的计算抽象，并提出模拟中最相关的紧急结果，这些结果支持Varela， Coutinho和Stewart，当他们在这个网络中看到解决相互冲突的免疫学问题的一种特权方式时。近年来，我们对展示有趣的连接结构的不断发展的网络重新产生了兴趣。独特型网络就是这样一种网络，为了很好地匹配两种抗体的概率，即所谓的“渗透值”，它表现出一种特殊的连接结构。对于这个值，网络能够展示最有效的记忆能力，并有效地将其耐受性与免疫反应分开。是否有可能这样一种生物网络，通过有意地将其细胞的匹配概率调整到给定值，改善周围细胞之间的通信，表现出一种次要效应，即出现一种两分法行为，宽容和免疫，以及对以前相遇的最佳记忆。
This paper will summarize the computational abstractions lying behind the simulation of immune idiotypic networks and present the most relevant emergent outcomes of the simulation, the same outcomes that give support to Varela, Coutinho and Stewart, when they see in this network one privileged way to address conflicting immunological questions. These more recent years, we have attended a resurgent interest for evolving networks showing interesting connectivity structure. The idiotypic network turns out to be such a kind of network and, for a well-tuned probability of matching two antibodies, the so called “percolation value”, it exhibits a particular connectivity structure. For this value, the network is able to demonstrate the most effective memorisation capacity and to usefully keep separated its tolerant from its immune responses. Would it be possible that such a kind of biological network, by deliberately tuning the matching probability of its cells to a given value, improving the communication among surrounding cells, exhibit as a secondary effect both the emergence of a dichotomous behaviour, tolerant and immune, and the best memorisation of previous encounters.