Abstract
Protein-protein interactions (PPIs) play important roles in a variety of biological processes, and many PPIs have been regarded as biologically compelling targets for drug discovery. Extensive efforts have been made to develop feasible proteinprotein docking approaches to study PPIs in silico. Most of these approaches are composed of two stages: sampling and scoring. Sampling is used to generate a number of plausible protein-protein binding conformations and scoring can rank all those conformations. Due to large and flexible binding interface of PPI, determination of the near native structures is computationally expensive, and therefore computational efficiency is the most challenging issue in protein-protein docking. Here, we have reviewed the basic concepts and implementations of the sampling, scoring and acceleration algorithms in some established docking programs, and the limitations of these algorithms have been discussed. Then, some suggestions to the future directions for sampling, scoring and acceleration algorithms have been proposed. This review is expected to provide a better understanding of protein-protein docking and give some clues for the optimization and improvement of available approaches.
Keywords: Acceleration, GPU, machine learning, protein-protein docking, ranking, scoring function.
Graphical Abstract
Current Drug Targets
Title:Recent Advances in Protein-Protein Docking
Volume: 17 Issue: 14
Author(s): Qian Zhang, Ting Feng, Lei Xu, Huiyong Sun, Peichen Pan, Youyong Li, Dan Li and Tingjun Hou
Affiliation:
Keywords: Acceleration, GPU, machine learning, protein-protein docking, ranking, scoring function.
Abstract: Protein-protein interactions (PPIs) play important roles in a variety of biological processes, and many PPIs have been regarded as biologically compelling targets for drug discovery. Extensive efforts have been made to develop feasible proteinprotein docking approaches to study PPIs in silico. Most of these approaches are composed of two stages: sampling and scoring. Sampling is used to generate a number of plausible protein-protein binding conformations and scoring can rank all those conformations. Due to large and flexible binding interface of PPI, determination of the near native structures is computationally expensive, and therefore computational efficiency is the most challenging issue in protein-protein docking. Here, we have reviewed the basic concepts and implementations of the sampling, scoring and acceleration algorithms in some established docking programs, and the limitations of these algorithms have been discussed. Then, some suggestions to the future directions for sampling, scoring and acceleration algorithms have been proposed. This review is expected to provide a better understanding of protein-protein docking and give some clues for the optimization and improvement of available approaches.
Export Options
About this article
Cite this article as:
Zhang Qian, Feng Ting, Xu Lei, Sun Huiyong, Pan Peichen, Li Youyong, Li Dan and Hou Tingjun, Recent Advances in Protein-Protein Docking, Current Drug Targets 2016; 17 (14) . https://dx.doi.org/10.2174/1389450117666160112112640
DOI https://dx.doi.org/10.2174/1389450117666160112112640 |
Print ISSN 1389-4501 |
Publisher Name Bentham Science Publisher |
Online ISSN 1873-5592 |
Related Books

- Author Guidelines
- Bentham Author Support Services (BASS)
- Graphical Abstracts
- Fabricating and Stating False Information
- Research Misconduct
- Post Publication Discussions and Corrections
- Publishing Ethics and Rectitude
- Increase Visibility of Your Article
- Archiving Policies
- Peer Review Workflow
- Order Your Article Before Print
- Promote Your Article
- Manuscript Transfer Facility
- Editorial Policies
- Allegations from Whistleblowers