Abstract
A search algorithm, 3 DSEARCH , is presented that can readily identify challenging extended chemical queries from three-dimensional molecular crystal structure information. The program combines substructure search and distance search techniques within a depth-first backtracking algorithm. Performance metrics are presented for example searches composed of several substructures and several intermolecular connections. It is shown that such searches, which are outside the capabilities of current search engines, can now be performed on the entire Cambridge Structural Database with search times of around half an hour.
Keywords
SubstructureBacktrackingComputer scienceAlgorithmSearch algorithmDatabaseData structureSearch engineInformation retrievalData miningProgramming languageEngineering
Affiliated Institutions
Related Publications
Retrieval of Crystallographically-Derived Molecular Geometry Information
The crystallographically determined bond length, valence angle, and torsion angle information in the Cambridge Structural Database (CSD) has many uses. However, accessing it by ...
The SWISS-MODEL workspace: a web-based environment for protein structure homology modelling
Abstract Motivation: Homology models of proteins are of great interest for planning and analysing biological experiments when no experimental three-dimensional structures are av...
Publication Info
- Year
- 2004
- Type
- article
- Volume
- 37
- Issue
- 2
- Pages
- 331-334
- Citations
- 32
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
32
OpenAlex
Cite This
James A. Chisholm,
S. Motherwell
(2004).
A new algorithm for performing three-dimensional searches of the Cambridge Structural Database.
Journal of Applied Crystallography
, 37
(2)
, 331-334.
https://doi.org/10.1107/s0021889804002924
Identifiers
- DOI
- 10.1107/s0021889804002924