The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
A new Lamarckian genetic algorithm for flexible ligand‐receptor docking
Abstract
We present a Lamarckian genetic algorithm (LGA) variant for flexible ligand‐receptor docking which allows to handle a large number of degrees of freedom. Our hybrid method combines a multi‐deme LGA with a recently published gradient‐based method for local optimization of molecular complexes. We compared the performance of our new hybrid method to two non gradient‐based search heuristics on the Astex diverse set for flexible ligand‐receptor docking. Our results show that the novel approach is clearly superior to other LGAs employing a stochastic optimization method. The new algorithm features a shorter run time and gives substantially better results, especially with increasing complexity of the ligands. Thus, it may be used to dock ligands with many rotatable bonds with high efficiency. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
R: A Language and Environment for Statistical Computing
R Core Team (2025) · doi:10.32614/r.manuals · Cited by 352,181
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Development and validation of a genetic algorithm for flexible docking 1 1Edited by F. E. Cohen
Jones, G., Willett, P., Glen, R. C., Leach, A. R., & Taylor, R. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0897 · Cited by 6,763
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632
Updating quasi-Newton matrices with limited storage
Nocedal, J. (1980) · Mathematics of Computation · doi:10.1090/s0025-5718-1980-0572855-7 · Cited by 2,958
A semiempirical free energy force field with charge‐based desolvation
Huey, R., Morris, G. M., Olson, A. J., & Goodsell, D. S. (2007) · Journal of Computational Chemistry · doi:10.1002/jcc.20634 · Cited by 2,246
Abagyan, R., Totrov, M., & Kuznetsov, D. (1994) · Journal of Computational Chemistry · doi:10.1002/jcc.540150503 · Cited by 1,699
Minimization by Random Search Techniques
Solis, F. J., & Wets, R. J.-B. (1981) · Mathematics of Operations Research · doi:10.1287/moor.6.1.19 · Cited by 1,671
Monte Carlo-minimization approach to the multiple-minima problem in protein folding.
Li, Z., & Scheraga, H. A. (1987) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.84.19.6611 · Cited by 1,468
Dennis, J. E., & Schnabel, R. B. (1996) · Cited by 949
Efficient and Accurate Parallel Genetic Algorithms
Cantú‐Paz, E. (2001) · Genetic algorithms and evolutionary computation · doi:10.1007/978-1-4615-4369-5 · Cited by 869
Gohlke, H., & Klebe, G. (2002) · Angewandte Chemie International Edition · doi:10.1002/1521-3773(20020802)41:15<2644::aid-anie2644>3.0.co;2-o · Cited by 843
Charifson, P. S., Corkery, J. J., Murcko, M. A., & Walters, W. P. (1999) · Journal of Medicinal Chemistry · doi:10.1021/jm990352k · Cited by 698
Gehlhaar, D. K., Verkhivker, G. M., Rejto, P. A., Sherman, C. J., Fogel, D. R., Fogel, L. J., & Freer, S. T. (1995) · Chemistry & Biology · doi:10.1016/1074-5521(95)90050-0 · Cited by 684
Diverse, High-Quality Test Set for the Validation of Protein−Ligand Docking Performance
Hartshorn, M. J., Verdonk, M. L., Chessari, G., Brewerton, S. C., Mooij, W. T. M., Mortenson, P. N., & Murray, C. W. (2007) · Journal of Medicinal Chemistry · doi:10.1021/jm061277y · Cited by 625
Evaluation of Docking Performance: Comparative Data on Docking Algorithms
Kontoyianni, M., McClellan, L. M., & Sokol, G. S. (2004) · Journal of Medicinal Chemistry · doi:10.1021/jm0302997 · Cited by 600
The solution of nonlinear finite element equations
Matthies, H., & Strang, G. (1979) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620141104 · Cited by 511
Practical Parameterization of Rotations Using the Exponential Map
Grassia, F. S. (1998) · Journal of Graphics Tools · doi:10.1080/10867651.1998.10487493 · Cited by 495
ON THE SOLUTION OF NONLINEAR FINITE ELEMENT EQUATIONS.
Bathe, K., Dvorkin, E. N., & Kojić, M. (1984) · Cited by 430
A genetic algorithm for flexible molecular overlay and pharmacophore elucidation
Jones, G., Willett, P., & Glen, R. C. (1995) · Journal of Computer-Aided Molecular Design · doi:10.1007/bf00124324 · Cited by 390
Flexible ligand docking using a genetic algorithm
Oshiro, C. M., Kuntz, I. D., & Dixon, J. S. (1995) · Journal of Computer-Aided Molecular Design · doi:10.1007/bf00124402 · Cited by 275
Corbeil, C. R., Englebienne, P., & Moitessier, N. (2007) · Journal of Chemical Information and Modeling · doi:10.1021/ci6002637 · Cited by 215
DARWIN: A program for docking flexible molecules
Taylor, J. S., & Burnett, R. M. (2000) · Proteins Structure Function and Bioinformatics · doi:10.1002/1097-0134(20001101)41:2<173::aid-prot30>3.0.co;2-3 · Cited by 140
Namasivayam, V., & Günther, R. (2007) · Chemical Biology & Drug Design · doi:10.1111/j.1747-0285.2007.00588.x · Cited by 138
SODOCK: Swarm optimization for highly flexible protein–ligand docking
Chen, H., Liu, B., Huang, H., Hwang, S., & Ho, S. (2006) · Journal of Computational Chemistry · doi:10.1002/jcc.20542 · Cited by 133
Prodock: Software package for protein modeling and docking
Trosset, J., & Scheraga, H. A. (1999) · Journal of Computational Chemistry · Cited by 103
BALL—rapid software prototyping in computational molecular biology
Kohlbacher, O., & Lenhof, H. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.9.815 · Cited by 99
Self-citationTietze, S., & Apostolakis, J. (2007) · Journal of Chemical Information and Modeling · doi:10.1021/ci7001236 · Cited by 67
A genetic algorithm based method for docking flexible molecules
Judson, R., Jaeger, E. P., & Treasurywala, A. M. (1994) · Journal of Molecular Structure THEOCHEM · doi:10.1016/0166-1280(94)80102-9 · Cited by 63
A consensus line search algorithm for molecular potential energy functions
Rurainski, A., Hildebrandt, A., & Lenhof, H. (2008) · Journal of Computational Chemistry · doi:10.1002/jcc.21175 · Cited by 3
Self-citation(1998) · doi:10.1002/(sici)1096-987x(19981115)19:14<1639::aid-jcc10>3.0.co;2-b
Cited by
Latest developments in molecular docking: 2010–2011 in review
Yuriev, E., & Ramsland, P. A. (2013) · Journal of Molecular Recognition · doi:10.1002/jmr.2266 · Cited by 344
Metadata
- Authors
- Fuhrmann, J., Rurainski, A., Lenhof, H., & Neumann, D.
- Venue
- Journal of Computational Chemistry
- Publisher
- Wiley
- Published
- 2010-01-15
- Volume
- 31
- Issue
- 9
- Pages
- 1911-1918
- ISSN
- 0192-8651 (ISSN-L)
- 1096-987X
- OpenAlex
- W2108001390
- Cited by
- 297
- References
- 34
- FWCI
- 6.80
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.