Abstract
As the number of available ligand–receptor complexes is increasing, researchers are becoming more dedicated to mine these complexes to aid in the drug design and development process. We present free software which is developed as a tool for performing similarity search across ligand–receptor complexes for identifying binding pockets which are similar to that of a target receptor. The search is based on 3D-geometric and chemical similarity of the atoms forming the binding pocket. For each match identified, the ligand’s fragment(s) corresponding to that binding pocket are extracted, thus forming a virtual library of fragments (FragVLib) that is useful for structure-based drug design. The program provides a very useful tool to explore available databases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsSpringer Nature is developing a new tool to find and evaluate Protocols. Learn more
References
Hajduk PJ, Greer J (2007) A decade of fragment-based drug design: strategic advances and lessons learned. Nat Rev Drug Discov 6:211–219
Loving K, Alberts I, Sherman W (2010) Computational approaches for fragment-based and de novo design. Curr Top Med Chem 10:14–32
Rees DC, Congreve M, Murray CW, Carr R (2004) Fragment-based lead discovery. Nat Rev Drug Discov 3:660–672
Schneider G, Fechner U (2005) Computer-based de novo design of drug-like molecules. Nat Rev Drug Discov 4:649–663
Khashan R (2012) FragVLib a free database mining software for generating “Fragment-based Virtual Library” using pocket similarity search of ligand-receptor complexes. J Cheminform 4:18
Bandyopadhyay D, Snoeyink J (2007) Almost-Delaunay simplices: robust neighbor relations for imprecise 3D points using CGAL. Comput Geom 38:4–15
Detering C, Gastreich M, Lemmen C (2010) Leading fragments to lead structures: fragment evolution, merging and core replacement, and docking. Chem Inform Bull 62:62
Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraph in the presence of isomorphism. In: Proceedings of the 3rd IEEE international conference on data mining (ICDM), Melbourne, Florida, 19–22 Nov 2003
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this protocol
Cite this protocol
Khashan, R.S. (2015). Generating “Fragment-Based Virtual Library” Using Pocket Similarity Search of Ligand–Receptor Complexes. In: Klon, A. (eds) Fragment-Based Methods in Drug Discovery. Methods in Molecular Biology, vol 1289. Humana Press, New York, NY. https://doi.org/10.1007/978-1-4939-2486-8_3
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2486-8_3
Published:
Publisher Name: Humana Press, New York, NY
Print ISBN: 978-1-4939-2485-1
Online ISBN: 978-1-4939-2486-8
eBook Packages: Springer Protocols