Competitive antagonists vs any agonist

  • Thread starter Thread starter alfredhershey
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around the possibility of designing competitive antagonists with higher affinity for receptors compared to any agonist. It explores concepts related to receptor binding, affinity measurements, and the implications of reversible versus irreversible binding in pharmacology.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants propose that it is possible to design competitive antagonists with higher affinity than a given agonist, depending on binding interactions and molecular stability.
  • Others express uncertainty about the universality of this claim, suggesting that while it may be feasible, it is not guaranteed for 'any agonist'.
  • A participant clarifies that the context is reversible binding and emphasizes the importance of the dissociation constant (Kd) in determining affinity.
  • There is discussion about the lack of a definitive mathematical proof for the claim, with suggestions that experimental measurements are necessary to establish Kd values for both agonists and antagonists.
  • Some participants mention that current computational methods can estimate affinities based on receptor-ligand structures, but these estimates do not constitute proof without experimental validation.

Areas of Agreement / Disagreement

Participants express differing views on the feasibility of designing antagonists with higher affinity than any agonist, indicating that while some aspects are agreed upon, multiple competing perspectives remain regarding the generality of the claim.

Contextual Notes

The discussion highlights limitations in current understanding, particularly regarding the mathematical modeling of receptor-ligand interactions and the need for experimental validation of theoretical claims.

alfredhershey
Messages
3
Reaction score
0
Is it true that it should always be possible to design a competitive antagonist with higher affinity for the receptor than the affinity of any agonist?
 
Chemistry news on Phys.org
I don't know if I would say 'always' and 'any agonist', but it is possible to find orthosteric antagonists with higher affinity than a given agonist, why not?
E.g. if your antagonist forms better/additional binding interactions and/or displaces 'unhappy' water, it can form a more stable complex with the receptor, i.e. one with higher affinity. Not sure that it's 'easy' to find such a molecule, but I don't think anyone can prove that it's definitely not possible.
Note that the natural agonists of some receptors are not very potent, and antagonists (and agonists) with much higher affinity were found by doing drug discovery.

At least, this is what I know - if someone has better information on this, please do correct me.
 
Sorry, forgot to add that its in the context of reversible binding. By any agonist I mean any type. By higher affinity I mean lower Kd, so I believe some equation would be involved with the answer.

Is there some sort of mathematical way to prove this?
 
I was indeed thinking of reversible binding, because with irreversible binding the concept of affinity has to be modified a bit.
And indeed, lower dissociation constant means greater affinity.

I'm not sure I understand what equation you're looking for. The classic pharmacology of receptor binding usually obeys a 'logistic-like' pattern.
You can read more on this here:
http://www.sciencedirect.com/science/article/pii/S1056871914002470
(article kindly suggested to me by member Stephen Tashi)
and in this thread that I actually started myself, dealing with the error in IC50 determinations:
https://www.physicsforums.com/threads/error-on-biological-assay-results.792633/

Concerning your original question, by appropriate experiments you can measure the actual dissociation constant of the agonist and of the antagonist, and from what I know, in principle there is nothing stopping Kdantagonist from being smaller than Kdagonist for at least one [agonist, antagonist] pair.

A mathematical proof... I don't think so. I guess to do that you should be able to describe your receptor-ligand complex, in a biological environment, fully and exactly by a system of equations. I may be wrong, but I don't think we're there yet. Several computer programmes are available, which take the crystal structure of a receptor and the structures of several ligands (e.g. designed by you or combinatorially), and give you estimates of their affinity for the receptor. Some of them give very good predictions, and it may be that you can say with a good confidence margin that antagonist X is likely to have a better affinity than agonist A. But I don't suppose that'd count as a proof; you would have to make the molecules and test them :smile:
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 15 ·
Replies
15
Views
7K
  • · Replies 14 ·
Replies
14
Views
12K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
18
Views
3K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 36 ·
2
Replies
36
Views
5K
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K