{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T03:08:24Z","timestamp":1787281704520,"version":"build-2736575974"},"reference-count":32,"publisher":"Oxford University Press (OUP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,3,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Motivation: Conformational searches in molecular docking are a time-consuming process with wide range of applications. Favorable conformations of the ligands that successfully bind with receptors are sought to form stable ligand\u2013receptor complexes. Usually a large number of conformations are generated and their binding energies are examined. We propose adding a geometric screening phase before an energy minimization procedure so that only conformations that geometrically fit in the binding site will be prompted for energy calculation.<\/jats:p><jats:p>Results: Geometric screening can drastically reduce the number of conformations to be examined from millions (or higher) to thousands (or lower). The method can also handle cases when there are more variables than geometric constraints. An early-stage implementation is able to finish the geometric filtering of conformations for molecules with up to nine variables in 1 min. To the best of our knowledge, this is the first time such results are reported deterministically.<\/jats:p><jats:p>Contact: \u00a0mzhang@mdanderson.org<\/jats:p>","DOI":"10.1093\/bioinformatics\/bti055","type":"journal-article","created":{"date-parts":[[2004,10,13]],"date-time":"2004-10-13T01:32:31Z","timestamp":1097631151000},"page":"624-630","source":"Crossref","is-referenced-by-count":16,"title":["Improving conformational searches by geometric screening"],"prefix":"10.1093","volume":"21","author":[{"given":"Ming","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R. Allen","family":"White","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liqun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronald","family":"Goldman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lydia","family":"Kavraki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brendan","family":"Hassett","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2004,10,12]]},"reference":[{"key":"2023013107211911600_B1","doi-asserted-by":"crossref","unstructured":"Aubry, P., Rouillier, F., El Din, M.S. 2002Real solving for positive dimensional systems. J. Symbolic Comput.34543\u2013560","DOI":"10.1006\/jsco.2002.0563"},{"key":"2023013107211911600_B2","unstructured":"Baker, D. and Sali, A. 2001Protein structure prediction and structural genomics. Science29493\u201396"},{"key":"2023013107211911600_B3","doi-asserted-by":"crossref","unstructured":"Baurin, N., Baker, R., Richardson, C., Chen, I., Foloppe, N., Potter, A., Jordan, A., Roughley, S., Parratt, M., Greaney, P., Morley, D., Hubbard, R.E. 2004Drug-like annotation and duplicate analysis of a 23-supplier chemical database totalling 2.7 million compounds. J. Chem. Inf. Comput. Sci.44643\u2013651","DOI":"10.1021\/ci034260m"},{"key":"2023013107211911600_B4","unstructured":"Brooijmans, N. and Kuntz, I.D. 2003Molecular recognition and docking algorithms. Ann. Rev. Biophys. and Biomol. Struct.32335\u2013373"},{"key":"2023013107211911600_B5","doi-asserted-by":"crossref","unstructured":"Bursulaya, B.D., Totrov, M., Abagyan, R., Brooks, C.L. 2003Comparative study of several algorithms for flexible ligand docking. J. Comput. Aid. Mol. Des.17755\u2013763","DOI":"10.1023\/B:JCAM.0000017496.76572.6f"},{"key":"2023013107211911600_B6","doi-asserted-by":"crossref","unstructured":"Cavasotto, C.N. and Abagyan, R.A. 2004Protein flexibility in ligand docking and virtual screening to protein kinases. J. Mol. Biol.12337 209\u2013225","DOI":"10.1016\/j.jmb.2004.01.003"},{"key":"2023013107211911600_B7","doi-asserted-by":"crossref","unstructured":"Coutsias, E.A., Seok, C., Jacobson, M.P., Dill, K. 2004A kinematic view of loop closure. J. Comput. Chem.25510\u2013528","DOI":"10.1002\/jcc.10416"},{"key":"2023013107211911600_B8","unstructured":"Diller, D.J. and Merz, K.M., Jr. 2001High throughput docking for library design and library prioritization. Proteins43113\u2013124"},{"key":"2023013107211911600_B9","unstructured":"Emiris, I. and Mourrain, B. 1999Computer algebra methods for studying and computing molecular conformations. Algorithmica25372\u2013402"},{"key":"2023013107211911600_B10","unstructured":"Ewing, T.J.A., Makino, S., Skillman, A.G., Kuntz, I.D. 2001DOCK 4.0: search strategies for automated molecular docking of flexible molecule databases. J. Comput. Aid. Mol. Des.15411\u2013428"},{"key":"2023013107211911600_B11","unstructured":"Finn, P.W. and Kavraki, L.E. 1999Computational approaches to drug design. Algorithmica25347\u2013371"},{"key":"2023013107211911600_B12","unstructured":"Goldman, R. Pyramid Algorithms: A Dynamic Programming Approach to Curves and Surfaces for Geometric Modeling2002, San Mateo, CA Morgan Kaufmann"},{"key":"2023013107211911600_B13","doi-asserted-by":"crossref","unstructured":"Henry, D.R. and Ozkabak, A.G. 1998Conformational flexibility in 3D structure searching. In Schleyer, P.R. (Ed.). Encyclopedia of Computational Chemistry , NY Wiley, pp. 543\u2013552","DOI":"10.1002\/0470845015.cca041"},{"key":"2023013107211911600_B14","unstructured":"Jones, G., Willett, P., Glen, R.C., Leach, A.R., Taylor, R. 1997Development and validation of a genetic algorithm for flexible docking. J. Mol. Biol.267727\u2013748"},{"key":"2023013107211911600_B15","unstructured":"Klebe, G. 2000Recent developments in structure-based drug design. J. Mol. Med.78269\u2013281"},{"key":"2023013107211911600_B16","doi-asserted-by":"crossref","unstructured":"Kramer, B., Rarey, M., Lengauer, T. 1999Evaluation of the FlexX incremental construction algorithm for protein\u2013ligand docking. Proteins37228\u2013241","DOI":"10.1002\/(SICI)1097-0134(19991101)37:2<228::AID-PROT8>3.0.CO;2-8"},{"key":"2023013107211911600_B17","doi-asserted-by":"crossref","unstructured":"Lavalle, S.M., Finn, P.W., Kavraki, L.E., Latombe, J.-C. 2000A randomized kinematics-based approach to pharmacophore-constrained conformational search and database screening. J. Comput. Chem.21731\u2013747","DOI":"10.1002\/(SICI)1096-987X(20000715)21:9<731::AID-JCC3>3.0.CO;2-R"},{"key":"2023013107211911600_B18","unstructured":"Lengauer, T. Bioinformatics\u2014From Genomics to Drugs2002, Weinheim Wiley-VCH Verlag GmbH"},{"key":"2023013107211911600_B19","doi-asserted-by":"crossref","unstructured":"Manocha, D. 1998Numerical methods for solving polynomial equations. Proceedings of Symposium in Applied Mathematics Vol. 53, pp. 41\u201366","DOI":"10.1090\/psapm\/053\/1602351"},{"key":"2023013107211911600_B20","doi-asserted-by":"crossref","unstructured":"Nakajima, N., Nakamura, H., Kidera, A. 1997Multicanonical ensemble generated by molecular dynamics simulation for enhanced conformational sampling of peptides. J. Phys. Chem. B101817\u2013824","DOI":"10.1021\/jp962142e"},{"key":"2023013107211911600_B21","unstructured":"Pak, Y. and Wang, S. 2000Application of a molecular dynamics simulation method with a generalized effective potential to the flexible molecular docking problems. J. Phys. Chem. B104354\u2013359"},{"key":"2023013107211911600_B22","doi-asserted-by":"crossref","unstructured":"Pedersen, P., Roy, M.-F., Szpirglas, A. 1993Counting real zeros in the multivariate case. In Eyssette, F. and Galligo, A. (Eds.). Computational Algebraic Geometry , Boston, MA Birkhauser, pp. 203\u2013224","DOI":"10.1007\/978-1-4612-2752-6_15"},{"key":"2023013107211911600_B23","doi-asserted-by":"crossref","unstructured":"Perola, E. and Charifson, P.S. 2004Conformational analysis of drug-like molecules bound to proteins: an extensive study of ligand reorganization upon binding. J. Med. Chem.472499\u20132510","DOI":"10.1021\/jm030563w"},{"key":"2023013107211911600_B24","unstructured":"Press, W., Flannery, B., Teukolsky, S., Betterling, W. Numerical Recipes: The Art of Scientific Computing1990, Cambridge Cambridge University Press"},{"key":"2023013107211911600_B25","doi-asserted-by":"crossref","unstructured":"Rarey, M., Wefing, S., Lengauer, T. 1996Placement of medium-sized molecular fragments into active sites of proteins. J. Comput. Aid. Mol. Des.10, pp. 41\u201354","DOI":"10.1007\/BF00124464"},{"key":"2023013107211911600_B26","doi-asserted-by":"crossref","unstructured":"Rojas, J.M. 2000Some speed-ups and speed limits for real algebraic geometry. J. Complexity16552\u2013571","DOI":"10.1006\/jcom.2000.0553"},{"key":"2023013107211911600_B27","doi-asserted-by":"crossref","unstructured":"Samudrala, R., Huang, E.S., Koehl, P., Levitt, L. 2000Constructing side chains on near-native main chains for ab initio protein structure prediction. Protein Eng.3453\u2013457","DOI":"10.1093\/protein\/13.7.453"},{"key":"2023013107211911600_B28","doi-asserted-by":"crossref","unstructured":"Song, G. and Amato, N.M. 2002Using motion planning to study protein folding pathways. J. Comput. Biol.9149\u2013168","DOI":"10.1145\/369133.369239"},{"key":"2023013107211911600_B29","unstructured":"Verkhivker, G.M., Bouzida, D., Gehlhaar, D.K., Rejto, P.A., Arthurs, S., Colson, A.B., Freer, S.T., Larson, V., Luty, B.A., Marrone, T., Rose, P.W. 2000Deciphering common failures in molecular docking of ligand\u2013protein complexes. J. Comput. Aid. Mol. Des.14731\u2013751"},{"key":"2023013107211911600_B30","doi-asserted-by":"crossref","unstructured":"Vieth, M., Hirst, J.D., Dominy, B.N., Daigler, H., Brooks, C.L. 1998Assessing search strategies for flexible docking. J. Comput. Chem.191623\u20131631","DOI":"10.1002\/(SICI)1096-987X(19981115)19:14<1623::AID-JCC8>3.0.CO;2-L"},{"key":"2023013107211911600_B31","doi-asserted-by":"crossref","unstructured":"Zhang, M. and Kavraki, L.E. 2002A new method for fast and accurate derivation of molecular conformations. J. Chem. Inform. Comput. Sci.4264\u201370","DOI":"10.1002\/chin.200221207"},{"key":"2023013107211911600_B32","doi-asserted-by":"crossref","unstructured":"Zhang, M. and White, R.A. 2003A molecular inverse kinematics problem: an approximation approach and challenges. Proceedings of the Asian Symposium on Computer Mathematics 2003 , Singapore World Scientific Publishing Co., pp. 276\u2013287","DOI":"10.1142\/9789812704436_0023"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/5\/624\/48962341\/bioinformatics_21_5_624.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/5\/624\/48962341\/bioinformatics_21_5_624.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,14]],"date-time":"2024-01-14T16:38:31Z","timestamp":1705250311000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/5\/624\/220250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,12]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2005,3,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bti055","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2005,3,1]]},"published":{"date-parts":[[2004,10,12]]}}}