Solving the Competitive Binding Equilibria between Many Ligands: Application to High-Throughput Screening and Affinity Optimization

Modern small-molecule drug discovery relies on the selective targeting of biological macromolecules by low-molecular weight compounds. Therefore, the binding affinities of candidate drugs to their targets are key for pharmacological activity and clinical use. For drug discovery methods where multiple drug candidates can simultaneously bind to the same target, a competition is established, and the resulting equilibrium depends on the dissociation constants and concentration of all the species present. Such coupling between all equilibrium-governing parameters complicates analysis and development of improved mixture-based, high-throughput drug discovery techniques. In this work, we present an iterative computational algorithm to solve coupled equilibria between an arbitrary number of ligands and a biomolecular target that is efficient and robust. The algorithm does not require the estimation of initial values to rapidly converge to the solution of interest. We explored binding equilibria under ligand/receptor conditions used in mixture-based library screening by affinity selection-mass spectrometry (AS-MS). Our studies support a facile method for affinity-ranking hits. The ranking method involves varying the receptor-to-ligand concentration ratio in a pool of candidate ligands in two sequential AS-MS analyses. The ranking is based on the relative change in bound ligand concentration. The method proposed does not require a known reference ligand and produces a ranking that is insensitive to variations in the concentration of individual compounds, thereby enabling the use of unpurified compounds generated by mixture-based combinatorial synthesis techniques.