2000
DOI: 10.1002/9783527613083.ch5
|View full text |Cite
|
Sign up to set email alerts
|

Modelling Structure‐Activity Relationships

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2007
2007
2020
2020

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(21 citation statements)
references
References 74 publications
0
21
0
Order By: Relevance
“…This is frequently pursued through iterative Structure-Activity Relationship (SAR) studies where individual moieties of a ligand are optimised sequentially. 8,9 A major simplification implicit in this approach is the additivity of the binding free energy, i.e. the assumption that binding free energies can be decomposed into a sum of independent components ascribed to specific parts of the system.…”
Section: Introductionmentioning
confidence: 99%
“…This is frequently pursued through iterative Structure-Activity Relationship (SAR) studies where individual moieties of a ligand are optimised sequentially. 8,9 A major simplification implicit in this approach is the additivity of the binding free energy, i.e. the assumption that binding free energies can be decomposed into a sum of independent components ascribed to specific parts of the system.…”
Section: Introductionmentioning
confidence: 99%
“…The solution to the ranked-retrieval problem relies on the well known fact that chemical structure of a compound relates to its activity (SAR) [9]. As such, effective solutions can be devised that rank the compounds on the database based on how structurally similar they are to the query.…”
Section: Problem Statement and Motivationmentioning
confidence: 99%
“…The similarity between chemical compounds is usually computed by first transforming them into a suitable descriptorspace representation [8,9]. A number of different approaches have been developed to represent each compound by a set of descriptors.…”
Section: Descriptor Spaces For Ranked-retrievalmentioning
confidence: 99%
See 1 more Smart Citation
“…Specifically, if A is the set of compounds that have been retrieved thus far, then the next compound c next that is selected is given by (2) This compound is added to A, removed from the database, and the overall process is repeated until the desired number of compounds has been retrieved. Depending on whether the indirect similarities are computed on the NG or MG graph, we will refer to this retrieval strategy as BestSimNG or BestSimMG, respectively.…”
Section: Best-sim Retrievalmentioning
confidence: 99%