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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A new Lamarckian genetic algorithm for flexible ligand‐receptor docking. https://app.cochat.ai/papers/10.1002/jcc.21478
- The paper
- Fuhrmann, J., Rurainski, A., Lenhof, H., & Neumann, D. (2010). A new Lamarckian genetic algorithm for flexible ligand‐receptor docking. Journal of Computational Chemistry. https://doi.org/10.1002/jcc.21478
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.