Suppr超能文献

免疫网络中的概率学习:加权树匹配模型

Probabilistic learning in immune network: weighted tree matching model.

作者信息

Joshi R R, Krishnanand K

机构信息

Department of Mathematics, Indian Institute of Technology, Powai, Bombay, India.

出版信息

J Comput Biol. 1996 Spring;3(1):143-62. doi: 10.1089/cmb.1996.3.143.

Abstract

Adaptive learning properties (of clonal selection and affinity maturation) in the immune network model are investigated in this paper under a nonlinear data structural representation of the involved molecules. Weighted trees are constructed to model the multiple paratopes/epitopes on the antibodies/antigens. Parallel computing experiments are carried out for the canonical coding of these trees and the corresponding multiple matching interactions. Our experiments on real data have shown significant results on the cognitive properties of the immune network. These and other computational results are presented along with a discussion of future applications.

摘要

本文在相关分子的非线性数据结构表示下,研究了免疫网络模型中(克隆选择和亲和力成熟的)适应性学习特性。构建加权树以模拟抗体/抗原上的多个互补决定区/表位。针对这些树的规范编码以及相应的多重匹配相互作用进行了并行计算实验。我们对真实数据的实验在免疫网络的认知特性方面取得了显著成果。展示了这些以及其他计算结果,并讨论了未来的应用。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验