The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Algorithmic aspects of protein structure similarity
Abstract
We show that calculating contact map overlap (a measure of similarity of protein structures) is NP-hard, but can be solved in polynomial time for several interesting and relevant special cases. We identify an important special case of this problem corresponding to self-avoiding walks, and prove a decomposition theorem and a corollary approximation result for this special case. These are the first approximation algorithms with guaranteed error bounds, and NP-completeness results in the literature in the area of protein structure alignment/fold recognition for measures of structure similarity of practical interest.
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
Protein Structure Comparison by Alignment of Distance Matrices
Holm, L., & Sander, C. (1993) · Journal of Molecular Biology · doi:10.1006/jmbi.1993.1489 · Cited by 3,984 · cited 3×
“Several measures of protein structure similarity have been proposed and used over the past few years, attempting to assign to each pair of proteins a distance, presumably capturing the extent to which the two proteins \resemble" each other in structure, origin, and function [17, 7, 34, 8, 28, 9, 16, 25, 27, 30, 29, 22…”
BackgroundMethodA new approach to protein fold recognition
Jones, D. T., Taylort, W. R., & Thornton, J. M. (1992) · Nature · doi:10.1038/358086a0 · Cited by 1,221
Topology fingerprint approach to the inverse protein folding problem
Godzik, A., Kolinski, A., & Skolnick, J. (1992) · Journal of Molecular Biology · doi:10.1016/0022-2836(92)90693-e · Cited by 339
Metadata
- Authors
- Goldman, D., Istrail, S., & Papadimitriou, C. H.
- Venue
- 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 512-521
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W1916412816
- Cited by
- 172
- References
- 3
- FWCI
- 30.95
- Type
- conference paper
- 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: Algorithmic aspects of protein structure similarity. https://app.cochat.ai/papers/10.1109/sffcs.1999.814624
- The paper
- Goldman, D., Istrail, S., & Papadimitriou, C. H. (2003). Algorithmic aspects of protein structure similarity. 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). https://doi.org/10.1109/sffcs.1999.814624
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.
