Derangement model of ligand-receptor binding

Author:

Williams Mobolaji1

Affiliation:

1. School of Engineering and Applied Sciences , Harvard University, Cambridge , , USA

Abstract

Abstract We introduce a derangement model of ligand-receptor binding that allows us to quantitatively frame the question “How can ligands seek out and bind to their optimal receptor sites in a sea of other competing ligands and suboptimal receptor sites?” To answer the question, we first derive a formula to count the number of partial generalized derangements in a list, thus extending the derangement result of Gillis and Even. We then compute the general partition function for the ligand-receptor system and derive the equilibrium expressions for the average number of bound ligands and the average number of optimally bound ligands. A visual model of squares assembling onto a grid allows us to easily identify fully optimal bound states. Equilibrium simulations of the system reveal its extremes to be one of two types, qualitatively distinguished by whether optimal ligand-receptor binding is the dominant form of binding at all temperatures and quantitatively distinguished by the relative values of two critical temperatures. One of those system types (termed “search-limited,” as it was in previous work) does not exhibit kinetic traps and we thus infer that biomolecular systems where optimal ligand-receptor binding is functionally important are likely to be search-limited.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Computational Mathematics,Mathematical Physics,Molecular Biology,Biophysics

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3