PocketMatch (version 2.0): A parallel algorithm for the detection of structural similarities between protein ligand binding-sites


Autoria(s): Nagarajan, Deepesh; Chandra, Nagasuma
Data(s)

2013

Resumo

Knowledge of protein-ligand interactions is essential to understand several biological processes and important for applications ranging from understanding protein function to drug discovery and protein engineering. Here, we describe an algorithm for the comparison of three-dimensional ligand-binding sites in protein structures. A previously described algorithm, PocketMatch (version 1.0) is optimised, expanded, and MPI-enabled for parallel execution. PocketMatch (version 2.0) rapidly quantifies binding-site similarity based on structural descriptors such as residue nature and interatomic distances. Atomic-scale alignments may also be obtained from amino acid residue pairings generated. It allows an end-user to compute database-wide, all-to-all comparisons in a matter of hours. The use of our algorithm on a sample dataset, performance-analysis, and annotated source code is also included.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/49207/1/nat_con_par_com_tec_2013.pdf

Nagarajan, Deepesh and Chandra, Nagasuma (2013) PocketMatch (version 2.0): A parallel algorithm for the detection of structural similarities between protein ligand binding-sites. In: National Conference on Parallel Computing Technologies (PARCOMPTECH), FEB 21-23, 2013, Bangalore, INDIA.

Publicador

IEEE

Relação

http://dx.doi.org/10.1109/ParCompTech.2013.6621397

http://eprints.iisc.ernet.in/49207/

Palavras-Chave #Biochemistry
Tipo

Conference Proceedings

NonPeerReviewed