Ligand discovery on massively parallel systems

被引:5
作者
Shave, S. R. [1 ]
Taylor, P. [1 ]
Walkinshaw, M. [1 ]
Smith, L. [2 ]
Hardy, J. [2 ]
Trew, A. [2 ]
机构
[1] Univ Edinburgh, Inst Struct & Mol Biol, Sch Biol Sci, Edinburgh EH9 3JR, Midlothian, Scotland
[2] Univ Edinburgh, Sch Phys, EPCC, Edinburgh EH9 3JZ, Midlothian, Scotland
关键词
D O I
10.1147/rd.521.0057
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Virtual screening is an approach for identifying promising leads for drugs and is used in the pharmaceutical industry. We present the parallelization of LIDAEUS (LIgand Discovery At Edinburgh UniverSity), creating a massively parallel high- throughput virtual-screening code. This program is being used to predict the binding modes involved in the docking of small ligands to proteins. Parallelization efforts have focused on achieving maximum parallel efficiency and developing a memory-efficient parallel sorting routine. Using an IBM Blue Gene/L (TM) supercomputer, runtimes have been reduced from 8 days on a modest seven-node cluster to 62 minutes on 1,024 processors using a standard dataset of 1.67 million small molecules and FKBP12, a protein target of interest in immunosuppressive therapies. Using more-complex datasets, the code scales upward to make use of the full processor set of 2,048. The code has been successfully used,for the task of gathering data on approximately 1.67 million small molecules binding to approximately 400 high-quality crystallographically determined ligand-bound protein structures, generating data on more than 646 million protein-ligand complexes. A number of novel ligands have already been discovered and validated experimentally.
引用
收藏
页码:57 / 67
页数:11
相关论文
共 50 条
  • [31] A TRIDIAGONAL SOLVER FOR MASSIVELY PARALLEL COMPUTER-SYSTEMS
    REALE, F
    PARALLEL COMPUTING, 1990, 16 (2-3) : 361 - 368
  • [32] Mesh Variants for Massively Parallel Systems Using MATLAB
    Nasir, Faizan
    Bokhari, Mohammad Ubaidullah
    Samad, Abdus
    ADVANCES IN INFORMATION COMMUNICATION TECHNOLOGY AND COMPUTING, AICTC 2021, 2022, 392 : 227 - 234
  • [34] Scheduling problems in general purpose massively parallel systems
    Nemeth, G
    JOURNAL OF SYSTEMS ARCHITECTURE, 1997, 43 (6-7) : 425 - 435
  • [35] Scheduling problems in general purpose massively parallel systems
    Department of Telecommunications, Technical University of Budapest, 2 Sztoczek, H-1111 Budapest, Hungary
    J Syst Archit, 6-7 (425-435):
  • [36] Effect of noise on generalisation in massively parallel fuzzy systems
    Singh, S
    PATTERN RECOGNITION, 1998, 31 (11) : 1767 - 1775
  • [37] Massively parallel discovery of human-specific substitutions that alter enhancer activity
    Uebbing, Severin
    Gockley, Jake
    Reilly, Steven K.
    Kocher, Acadia A.
    Geller, Evan
    Gandotra, Neeru
    Scharfe, Curt
    Cotney, Justin
    Noonan, James P.
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2021, 118 (02)
  • [38] Profiling and Discovery of microRNAs Expressed in Hypoxic Endothelial Cells by Massively Parallel Sequencing
    Voellenkle, Christine
    van Rooij, Jeroen
    Guffanti, Alessandro
    Brini, Elena
    Fasanaro, Pasquale
    Croft, Laurence
    David, Matei
    Capogrossi, Maurizio C.
    Moles, Anna
    Felsani, Armando
    Martelli, Fabio
    CIRCULATION, 2010, 122 (21)
  • [39] Massively Parallel Discovery of Loosely Moving Congestion Patterns from Trajectory Data
    Hu, Chunchun
    Chen, Si
    ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2021, 10 (11)
  • [40] Massively Parallel Quantum Computer Simulations: Towards Realistic Systems
    Richter, Marcus
    Arnold, Guido
    Trieu, Binh
    Lippert, Thomas
    PARALLEL COMPUTING: ARCHITECTURES, ALGORITHMS AND APPLICATIONS, 2008, 15 : 61 - +