The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Molecular conformations from distance matrices
Abstract
Two algorithms are introduced that show exceptional promise in finding molecular conformations using distance geometry on nuclear magnetic resonance data. The first algorithm is a gradient version of the majorization algorithm from multidimensional scaling. The main contribution is a large decrease in CPU time. The second algorithm is an iterative algorithm between possible conformations obtained from the first algorithm and permissible data points near the configuration. These ideas are similar to alternating least squares or alternating projections on convex sets. The iterations significantly improve the conformation from the first algorithm when applied to the small peptide E. coli STh enterotoxin. © 1993 John Wiley & Sons, Inc.
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
Guttman, L. (1968) · Psychometrika · doi:10.1007/bf02290164 · Cited by 1,343
Cited by
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
Birgin, E. G., Martínez, J. M., & Raydan, M. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497330963 · Cited by 1,056
Self-citationLocalization from connectivity in sensor networks
Shang, Y., Rumi, W., Zhang, Y., & Fromherz, M. (2004) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2004.67 · Cited by 569
Data Visualization With Multidimensional Scaling
Buja, A., Swayne, D. F., Littman, M. L., Dean, N., Hofmann, H., & Chen, L. (2008) · Journal of Computational and Graphical Statistics · doi:10.1198/106186008x318440 · Cited by 306
Metadata
- Authors
- Glunt, W., Hayden, T. L., & Raydan, M.
- Venue
- Journal of Computational Chemistry
- Publisher
- Wiley
- Published
- 1993-01
- Volume
- 14
- Issue
- 1
- Pages
- 114-120
- ISSN
- 0192-8651 (ISSN-L)
- 1096-987X
- OpenAlex
- W2163392119
- Cited by
- 181
- References
- 1
- FWCI
- 1.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
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.