2008
DOI: 10.1186/1471-2105-9-543
|View full text |Cite
|
Sign up to set email alerts
|

PocketMatch: A new algorithm to compare binding sites in protein structures

Abstract: Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely explorato… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
211
0
1

Year Published

2010
2010
2024
2024

Publication Types

Select...
7
3

Relationship

3
7

Authors

Journals

citations
Cited by 160 publications
(213 citation statements)
references
References 28 publications
1
211
0
1
Order By: Relevance
“…PocketMatch uses a frame-invariant representation of binding sites as 90 lists of sorted distances capturing both the shape and the physicochemical properties of the cavity. 20 As to be expected for this peculiar data set, PocketMatch performs equally to FuzCav in terms of ROC score for classifying adenine-binding pockets from decoys (area under the ROC curve of 0.85, Table 4). PocketMatch is however still inferior to our method when enrichment in true positives among the top-scoring entries is considered ( Figure 5A).…”
Section: Resultsmentioning
confidence: 93%
“…PocketMatch uses a frame-invariant representation of binding sites as 90 lists of sorted distances capturing both the shape and the physicochemical properties of the cavity. 20 As to be expected for this peculiar data set, PocketMatch performs equally to FuzCav in terms of ROC score for classifying adenine-binding pockets from decoys (area under the ROC curve of 0.85, Table 4). PocketMatch is however still inferior to our method when enrichment in true positives among the top-scoring entries is considered ( Figure 5A).…”
Section: Resultsmentioning
confidence: 93%
“…In cases where only local and not global similarities can be detected between two unrelated protein cavities, this approach is likely to fail. Interestingly, alignment-free binding site comparison methods [88,89] have been recently reported to be as accurate as alignment-dependant site matching tools and suitable to detect local subpocket similarities. Although not necessary, the binding site reference to which all active sites are compared should be cocrystallized with a drug-like ligand to avoid ligand-induced fit phenomena.…”
Section: Pros and Consmentioning
confidence: 99%
“…Identification of all relevant binding sites in protein molecules, therefore becomes a key step in the process of gaining functional insights from protein structures. A number of methods have emerged in the last decade for the task of locating binding sites in proteins (Goodford, 1985 Yeturu and Chandra, 2008). They can be broadly classified into (a) geometry-based and (b) energy-based methods.…”
Section: Function Annotation At Binding Site Levelmentioning
confidence: 99%