# Competitive ligand binding kinetics to linear polymers

Source: [Competitive ligand binding kinetics to linear polymers](<https://www.sota2.com/research/paper/68fa47181e209131ce9255f0>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T06:09:11.654Z

Authors: Juan P.G. Villaluenga, David Brunete, Francisco Javier Cao-Garcia

Published: 2024-05-19T17:46:27.000Z

## Abstract

Different types of ligands compete in binding to polymers with different consequences for the physical and chemical properties of the resulting complex. Here, we derive a general kinetic model for the competitive binding kinetics of different types of ligands to a linear polymer, using the McGhee and von Hippel detailed binding site counting procedure. The derived model allows the description of the competitive binding process in terms of the size of the ligand, binding and release rates, and cooperativity parameters. We illustrate the implications of the general theory showing the equations for the competitive binding of two ligands. The size of the ligand, given by the number of monomers occluded, is shown to have a great impact in competitive binding. Ligands requiring a large available gap for binding are strongly inhibited by smaller ligands. Ligand size then has a leading role compared to binding affinity or cooperativity. For ligands that can bind in different modes (i.e., different number of monomers), this implies that they are more effective in covering or passivating the polymer in lower modes, if the different modes have similar binding energies.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2405.11631>)

[PDF](<https://arxiv.org/pdf/2405.11631.pdf>)
