2014
DOI: 10.1186/1472-6807-14-18
|View full text |Cite
|
Sign up to set email alerts
|

A simple method for finding a protein’s ligand-binding pockets

Abstract: BackgroundThis paper provides a simple and rapid method for a protein-clustering strategy. The basic idea implemented here is to use computational geometry methods to predict and characterize ligand-binding pockets of a given protein structure. In addition to geometrical characteristics of the protein structure, we consider some simple biochemical properties that help recognize the best candidates for pockets in a protein’s active site.ResultsOur results are shown to produce good agreement with known empirical… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(19 citation statements)
references
References 50 publications
0
18
0
1
Order By: Relevance
“…Asp was the most frequent single amino acid with 9 repetitions at the furin active site. This amino acid residue was mainly involved in the interactions as a hydrogen bond acceptor where polar interactions were especially favourable for complex protein-ligand stability [ 40 ]. Asp was also an acidic part of the so-called “classical” catalytic triad, three coordinated amino acids (together with Ser and His) which generated a charge-relay system for activating a nucleophilic attack on enzyme substrate.…”
Section: Discussionmentioning
confidence: 99%
“…Asp was the most frequent single amino acid with 9 repetitions at the furin active site. This amino acid residue was mainly involved in the interactions as a hydrogen bond acceptor where polar interactions were especially favourable for complex protein-ligand stability [ 40 ]. Asp was also an acidic part of the so-called “classical” catalytic triad, three coordinated amino acids (together with Ser and His) which generated a charge-relay system for activating a nucleophilic attack on enzyme substrate.…”
Section: Discussionmentioning
confidence: 99%
“… 66 . It can also be applied to search for a specific interface among a set of candidate interfaces on a protein’s surface, for example – for searching a DNA and RNA binding interfaces, given a set of candidate binding interfaces on a protein surface, or for searching a ligand binding interface from a list of potential interfaces given by a pocket prediction tool, such as CASTp 35 . By allowing a fast, sequence- and fold- independent search in large datasets of functional surfaces, PatchBag can boost the current comprehension of protein function, and reveal novel evolutionary relationships between protein surfaces and interfaces, which are yet unidentified due to lack of sufficient and efficient computational tools for surface comparisons.…”
Section: Discussionmentioning
confidence: 99%
“…Note that using this heuristic approach significantly reduces the complexity by avoiding a costly backtracking algorithm. In addition to PocketAlign [30], PocketFEATURE [77] and SiteEngine [69] assigned to this group, geometric hashing and sorting are employed by many other programs to find ligand-binding sites on protein surfaces [78], quantify the similarity between binding pockets [68] and classify functional sites in proteins [79].…”
Section: Group Iv: Methods Employing Geometric Hashing and Sortingmentioning
confidence: 99%