Real-time ligand binding pocket database search using local surface descriptors

被引:45
|
作者
Chikhi, Rayan [2 ]
Sael, Lee [3 ]
Kihara, Daisuke [1 ,3 ,4 ]
机构
[1] Purdue Univ, Coll Sci, Dept Biol Sci, W Lafayette, IN 47907 USA
[2] Ecole Normale Super, Dept Comp Sci, F-94235 Cachan, Britanny, France
[3] Purdue Univ, Coll Sci, Dept Comp Sci, W Lafayette, IN 47907 USA
[4] Purdue Univ, Coll Sci, Markey Ctr Struct Biol, W Lafayette, IN 47907 USA
基金
美国国家卫生研究院; 美国国家科学基金会;
关键词
protein surface; structure-based function prediction; pocket shape; pseudo-Zernike moments; 3D Zernike descriptors; ligand binding site; PROTEIN FUNCTION PREDICTION; STRUCTURAL GENOMICS; TERTIARY STRUCTURE; FUNCTIONAL SITES; SEQUENCE; SIMILARITY; CLASSIFICATION; IDENTIFICATION; ANNOTATION; EXPECTATIONS;
D O I
10.1002/prot.22715
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Because of the increasing number of structures of unknown function accumulated by ongoing structural genomics projects, there is an urgent need for computational methods for characterizing protein tertiary structures. As functions of many of these proteins are not easily predicted by conventional sequence database searches, a legitimate strategy is to utilize structure information in function characterization. Of particular interest is prediction of ligand binding to a protein, as ligand molecule recognition is a major part of molecular function of proteins. Predicting whether a ligand molecule binds a protein is a complex problem due to the physical nature of protein ligand interactions and the flexibility of both binding sites and ligand molecules. However, geometric and physicochemical complementarity is observed between the ligand and its binding site in many cases. Therefore, ligand molecules which bind to a local surface site in a protein can be predicted by finding similar local pockets of known binding ligands in the structure database. Here, we present two representations of ligand binding pockets and utilize them for ligand binding prediction by pocket shape comparison. These representations are based on mapping of surface properties of binding pockets, which are compactly described either by the two-dimensional pseudo-Zernike moments or the three-dimensional Zernike descriptors. These compact representations allow a fast real-time pocket searching against a database. Thorough benchmark studies employing two different datasets show that our representations are competitive with the other existing methods. Limitations and potentials of the shape-based methods as well as possible improvements are discussed.
引用
收藏
页码:2007 / 2028
页数:22
相关论文
共 50 条
  • [41] Real-Time Dispatching with Local Search Improvement for Dynamic Ride-Sharing
    Pouls, Martin
    Meyer, Anne
    Glock, Katharina
    [J]. COMPUTATIONAL LOGISTICS (ICCL 2021), 2021, 13004 : 299 - 315
  • [42] Comparing real-time and incremental heuristic search for real-time situated agents
    Koenig, Sven
    Sun, Xiaoxun
    [J]. AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2009, 18 (03) : 313 - 341
  • [43] Comparing real-time and incremental heuristic search for real-time situated agents
    Sven Koenig
    Xiaoxun Sun
    [J]. Autonomous Agents and Multi-Agent Systems, 2009, 18 : 313 - 341
  • [44] A real-time Active Routing approach via a database for airport surface movement
    Weiszer, Michal
    Chen, Jun
    Stewart, Paul
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2015, 58 : 127 - 145
  • [45] Real-Time Event Search Corresponding to Place and Time using Social Stream
    Kudo, Ruriko
    Enoki, Miki
    Nakao, Akihiro
    Yamamoto, Shu
    Yamaguchi, Saneyasu
    Oguchi, Masato
    [J]. 2017 IEEE 15TH INTL CONF ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, 15TH INTL CONF ON PERVASIVE INTELLIGENCE AND COMPUTING, 3RD INTL CONF ON BIG DATA INTELLIGENCE AND COMPUTING AND CYBER SCIENCE AND TECHNOLOGY CONGRESS(DASC/PICOM/DATACOM/CYBERSCI, 2017, : 1047 - 1053
  • [46] Active search for real-time vision
    Davison, AJ
    [J]. TENTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS 1 AND 2, PROCEEDINGS, 2005, : 66 - 73
  • [47] Seeker: Real-Time Interactive Search
    Biswas, Ari
    Pham, Thai T.
    Vogelsong, Michael
    Snyder, Benjamin
    Nassif, Houssam
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 2867 - 2875
  • [48] Minimax real-time heuristic search
    Koenig, S
    [J]. ARTIFICIAL INTELLIGENCE, 2001, 129 (1-2) : 165 - 197
  • [49] Earlybird: Real-Time Search at Twitter
    Busch, Michael
    Gade, Krishna
    Larson, Brian
    Lok, Patrick
    Luckenbill, Samuel
    Lin, Jimmy
    [J]. 2012 IEEE 28TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2012, : 1360 - 1369
  • [50] Real-Time Moving Target Search
    Undeger, Cagatay
    Polat, Faruk
    [J]. AGENT COMPUTING AND MULTI-AGENT SYSTEMS, 2009, 5044 : 110 - +