An efficient searching algorithm based on local shape complementarity of hydrogen bonds and relaxation labeling for protein-ligand docking

No abstract is available for this paper.

• Publication year

  2013

• Venue

  International Conference on Machine Learning and Computing

• Publication date

  2013-07-14

• Fields of study

  Biology, Materials Science, Chemistry, Computer Science

• Identifiers
  DOI 10.1109/ICMLC.2013.6890391
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Probabilistic Approach to Spectral Graph Matching

  2013cited by this paper
• Surface‐histogram: A new shape descriptor for protein‐protein docking

  2012cited by this paper
• UCSF Chimera, MODELLER, and IMP: an integrated modeling system.

  2012cited by this paper
• PRL‐dock: Protein‐ligand docking based on hydrogen bond matching and probabilistic relaxation labeling

  2012cited by this paper
• A fast protein-ligand docking algorithm based on hydrogen bond matching and surface shape complementarity

  2010influential reference
• Protein–ligand docking: Current status and future challenges

  2006cited by this paper
• Using quaternions to calculate RMSD

  2004cited by this paper
• Docking and scoring in virtual screening for drug discovery: methods and applications

  2004cited by this paper
• Improved protein–ligand docking using GOLD

  2003cited by this paper
• Comparative evaluation of 11 scoring functions for molecular docking.

  2003cited by this paper
• Small Molecule Docking and Scoring

  2001cited by this paper
• The Dynamics of Nonlinear Relaxation Labeling Processes

  1997cited by this paper
• Hydrogen bonding and molecular surface shape complementarity as a basis for protein docking.

  1996cited by this paper

• No citing papers are available for this paper.