Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 661

The DOI matches its Crossref record.

Evolving better nanoparticles: Genetic algorithms for optimising cluster geometries

Johnston, Roy L.·2003·Dalton Transactions

Abstract

A review is presented of the design and application of genetic algorithms for the geometry optimisation of clusters and nanoparticles, where the interactions between atoms, ions or molecules are described by a variety of potential energy functions. A general introduction to genetic algorithms is followed by a detailed description of the genetic algorithm program that we have developed to identify the lowest energy isomers for a variety of atomic and molecular clusters. Examples are presented of its application to model Morse clusters, ionic MgO clusters and bimetallic “nanoalloy” clusters. Finally, a number of recent innovations and possible future developments are discussed.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1039/b305686d

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 661

Metadata

Authors
Johnston, R. L.
Venue
Dalton Transactions
Published
2003
Issue
22
Pages
4193
ISSN
  • 1477-9226 (ISSN-L)
  • 1477-9234
OpenAlex
W2149568574
Cited by
661
References
0
FWCI
4.64
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: Evolving better nanoparticles: Genetic algorithms for optimising cluster geometries. https://app.cochat.ai/papers/10.1039/b305686d
The paper
Johnston, R. L. (2003). Evolving better nanoparticles: Genetic algorithms for optimising cluster geometries. Dalton Transactions. https://doi.org/10.1039/b305686d

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.