2012
DOI: 10.1002/jcc.23048
|View full text |Cite
|
Sign up to set email alerts
|

Parallel‐ProBiS: Fast parallel algorithm for local structural comparison of protein structures and binding sites

Abstract: The ProBiS algorithm performs a local structural comparison of the query protein surface against the nonredundant database of protein structures. It finds proteins that have binding sites in common with the query protein.Here, we present a new parallelized algorithm, Parallel-ProBiS, for detecting similar binding sites on clusters of computers. The obtained speedups of the parallel ProBiS scale almost ideally with the number of computing cores up to about 64 computing cores. Scaling is better for larger than f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0
1

Year Published

2012
2012
2021
2021

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 18 publications
(28 reference statements)
0
11
0
1
Order By: Relevance
“…In the binding site network, nodes are binding site structures and similar sites are connected by edges. Figure 1 presents the workflow in a sequence of 5 steps: 1) we generated the non-redundant protein structure databases using sequence identity cutoffs of 40, 70, and 90%; 2) non-redundant binding site structures were extracted from the databases; 3) structural similarities between all binding sites were calculated using the ProBiS 2 , 3 ; 4) the similarity scores were normalized into z-scores and the pairs of binding site pairs whose z-score is higher than a pre-defined threshold were connected by edges and 5) structurally similar binding sites were classified into communities to reduce the complexity of the network. Using the identified binding site communities, we investigated their size distribution, functional enrichment, and their relationships with ligands and domain structures.…”
Section: Resultsmentioning
confidence: 99%
“…In the binding site network, nodes are binding site structures and similar sites are connected by edges. Figure 1 presents the workflow in a sequence of 5 steps: 1) we generated the non-redundant protein structure databases using sequence identity cutoffs of 40, 70, and 90%; 2) non-redundant binding site structures were extracted from the databases; 3) structural similarities between all binding sites were calculated using the ProBiS 2 , 3 ; 4) the similarity scores were normalized into z-scores and the pairs of binding site pairs whose z-score is higher than a pre-defined threshold were connected by edges and 5) structurally similar binding sites were classified into communities to reduce the complexity of the network. Using the identified binding site communities, we investigated their size distribution, functional enrichment, and their relationships with ligands and domain structures.…”
Section: Resultsmentioning
confidence: 99%
“…Binding sites were predicted using the ProBiS web server [17] at http://probis.cmm.ki.si . Comparisons of binding site structures were done using the parallel ProBiS program [33] (version 2.4.2) freely available at http://probis.cmm.ki.si/?what=parallel . MD simulations were carried out on the clusters of personal computers (CROW) at the National Institute of Chemistry in Ljubljana [34] , using the CHARMM biomolecular simulation program [35] and CHARMMing web server [36] .…”
Section: Methodsmentioning
confidence: 99%
“…An open source of parallel-ProBiS 26 (version 2.3.8) was taken from the ProBiS web site (http://probis.cmm.ki.si) 27 All BS-structures for the benchmark set and the structure library were converted into the surface format (.srf) files for the template ligand search using ProBiS. Z_SCORE and SURF_VECTOR_ANGLE were set to −10.0 and 4.0, respectively, to turn off filtering of local structure alignment results.…”
Section: Methodsmentioning
confidence: 99%