The DOI matches its Crossref record.
Improved strategy in analytic surface calculation for molecular systems: Handling of singularities and computational efficiency
Abstract
Computer methods for analytic surface calculations of molecular systems suffer from numerical instabilities and are CPU time consuming. In this article, we present proposals toward the solution of both problems. Singularities arise when nearly collinear triples of neighboring atoms or multiple vertices are encountered during the calculation. Topological decisions in analytic surface calculation algorithms (accessibility of vertices and arcs) are based upon the comparison of distances or angles. If two such numbers are nearly equal, then currently used computer programs may not resolve this ambiguity correctly and can subsequently fail. In this article, modifications in the analytic surface calculation algorithm are described that recognize singularities automatically and treat them appropriately without restarting parts of the computation. The computing time required to execute these alterations is minimal. The basic modification consists in defining an accuracy limit within which two values may be assumed as equal. The search algorithm has been reformulated to reduce the computational effort. A new set of formulas makes it possible to avoid mostly the extraction of square roots. Tests for small‐and medium‐sized intersection circles and for pairs of vertices with small vertex height help recognize fully buried circles and vertex pairs at an early stage. The new program can compute the complete topology of the surface and accessible surface area of the protein crambin in 1.50–4.29 s (on a single R3000 processor of an SGI 4D/480) depending on the compactness of the conformation where the limits correspond to the fully extended or fully folded chain, respectively. The algorithm, implemented in a computer program, will be made available on request. © John Wiley & Sons, Inc.
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
Cited by
Classical Electrostatics in Biology and Chemistry
Honig, B., & Nicholls, A. (1995) · Science · doi:10.1126/science.7761829 · Cited by 2,879
Knowledge‐based protein secondary structure assignment
Frishman, D., & Argos, P. (1995) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340230412 · Cited by 2,523
Self-citationApproximate atomic surfaces from linear combinations of pairwise overlaps (LCPO)
Weiser, J., Shenkin, P. S., & Still, W. C. (1999) · Journal of Computational Chemistry · doi:10.1002/(sici)1096-987x(19990130)20:2<217::aid-jcc4>3.0.co;2-a · Cited by 1,198
Fraczkiewicz, R., & Braun, W. (1998) · Journal of Computational Chemistry · doi:10.1002/(sici)1096-987x(199802)19:3<319::aid-jcc6>3.0.co;2-w · Cited by 1,120
STRIDE: a web server for secondary structure assignment from known atomic coordinates of proteins
Heinig, M., & Frishman, D. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh429 · Cited by 1,003
Metadata
- Authors
- Eisenhaber, F., & Argos, P.
- Venue
- Journal of Computational Chemistry
- Publisher
- Wiley
- Published
- 1993-11
- Volume
- 14
- Issue
- 11
- Pages
- 1272-1280
- ISSN
- 0192-8651 (ISSN-L)
- 1096-987X
- OpenAlex
- W2122410355
- Cited by
- 205
- References
- 0
- FWCI
- 2.00
- 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: Improved strategy in analytic surface calculation for molecular systems: Handling of singularities and computational efficiency. https://app.cochat.ai/papers/10.1002/jcc.540141103
- The paper
- Eisenhaber, F., & Argos, P. (1993). Improved strategy in analytic surface calculation for molecular systems: Handling of singularities and computational efficiency. Journal of Computational Chemistry. https://doi.org/10.1002/jcc.540141103
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.