Parallel Algorithm for Discovering and Comparing Three-Dimensional Proteins Patterns

Identifying conserved (similar) three-dimensional patterns among a set of proteins can be helpful for the rational design of polypharmacological drugs. Some available tools allow this identification from a limited perspective, only considering the available information, such as known binding sites o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE/ACM transactions on computational biology and bioinformatics Jg. 21; H. 3; S. 508 - 515
Hauptverfasser: Valdes-Jimenez, Alejandro, Reyes-Parada, Miguel, Nunez-Vivanco, Gabriel, Jimenez-Gonzalez, Daniel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: United States IEEE 01.05.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Allosteric properties
Amino acids
Binding sites
Computational Biology - methods
CUDA
Databases, Protein
Distributed memory
Drug development
Drugs
Fingers
Graphics processing units
Hybrid systems
Models, Molecular
MPI
OpenMP
parallel and distributed programming
Protein Conformation
Proteins
Proteins - chemistry
Proteins - metabolism
Sequence Analysis, Protein - methods
Similarity
Structural proteins
Task analysis
Three-dimensional displays
three-dimensional patterns discovering
ISSN:1545-5963, 1557-9964, 1557-9964
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Identifying conserved (similar) three-dimensional patterns among a set of proteins can be helpful for the rational design of polypharmacological drugs. Some available tools allow this identification from a limited perspective, only considering the available information, such as known binding sites or previously annotated structural motifs. Thus, these approaches do not look for similarities among all putative orthosteric and or allosteric bindings sites between protein structures. To overcome this tech-weakness Geomfinder was developed, an algorithm for the estimation of similarities between all pairs of three-dimensional amino acids patterns detected in any two given protein structures, which works without information about their known patterns. Even though Geomfinder is a functional alternative to compare small structural proteins, it is computationally unfeasible for the case of large protein processing and the algorithm needs to improve its performance. This work presents several parallel versions of the Geomfinder to exploit SMPs, distributed memory systems, hybrid version of SMP and distributed memory systems, and GPU based systems. Results show significant improvements in performance as compared to the original version and achieve up to 24.5x speedup when analyzing proteins of average size and up to 95.4x in larger proteins.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1545-5963
1557-9964
1557-9964
DOI:10.1109/TCBB.2024.3367789