Cooperativity, Absolute Interaction, and Algebraic Optimization
We consider a measure of cooperativity based on the minimal absolute interaction required to generate an observed titration behavior. We describe the corresponding algebraic optimization problem and show how it can be solved using the nonlinear algebra tool \texttt{SCIP}. Moreover, we compute the minimal absolute interactions for various binding polynomials that describe the oxygen binding of various hemoglobins under different conditions. While calculated minimal absolute interactions are consistent with the expected outcome of the chemical modifications, it ranks the cooperativity of the molecules differently than the maximal Hill slope.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Cooperativity transitions driven by higher-order oligomer formations in ligand-induced receptor dimerization
While cooperativity in ligand-induced receptor dimerization has been linked with receptor-receptor couplings via minimal representations of physical observables, effects arising from higher-order oligomer (e.g., trimer a…
Information geometry of chemical reaction networks: Cramer-Rao bound and absolute sensitivity revisited
Information geometry is based on classical Legendre duality but allows to incorporate additional structure such as algebraic constraints and Bregman divergence functions. It is naturally suited, and has been successfully…
SensitivityMeasuring Successful Cooperation in Human-AI Teamwork: Development and Validation of the Perceived Cooperativity and Teaming Perception Scales
As human-AI cooperation becomes increasingly prevalent, reliable instruments for assessing the subjective quality of cooperative human-AI interaction are needed. We introduce two theoretically grounded scales: the Percei…
Detecting concentration changes with cooperative receptors
Cells constantly need to monitor the state of the environment to detect changes and timely respond. The detection of concentration changes of a ligand by a set of receptors can be cast as a problem of hypothesis testing,…
Galois/monodromy groups for decomposing minimal problems in 3D reconstruction
We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes …
3D ReconstructionHomography EstimationPose Estimation