The Community for Technology Leaders
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) (2015)
Krakow, Poland
Nov. 4, 2015 to Nov. 6, 2015
ISBN: 978-1-4673-8317-2
pp: 85-91
ABSTRACT
The Pocket-Finder algorithm identifies the location of ligand binding sites in a protein and is a fundamental component for a range of applications including molecular docking, de novo drug design and structural identification and comparison of functional sites. In this paper, we propose a parallel version of the Pocket-Finder algorithm. The proposed parallel algorithm uses a geometrical approach to locate favorable binding sites and has been MPI-enabled for parallel execution. The proposed algorithm has been applied on a small test of 15 proteins and 2 proteins complexes. The algorithm gets very interesting results when applied to large proteins.
INDEX TERMS
Proteins, Probes, Atomic measurements, Algorithm design and analysis, Parallel algorithms, Drugs, Complexity theory
CITATION

M. Mirto and G. Aloisio, "A Parallel Algorithm for the Prediction of Protein Binding Sites," 2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), Krakow, Poland, 2015, pp. 85-91.
doi:10.1109/3PGCIC.2015.123
89 ms
(Ver 3.3 (11022016))