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

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Finding sequence motifs in groups of functionally related proteins.

Open access
Smith, H O, Annau, T M, Chandrasegaran, S·1990·Proceedings of the National Academy of Sciences

Abstract

We have developed a method for rapidly finding patterns of conserved amino acid residues (motifs) in groups of functionally related proteins. All 3-amino acid patterns in a group of proteins of the type aa1 d1 aa2 d2 aa3, where d1 and d2 are distances that can be varied in a range up to 24 residues, are accumulated into an array. Segments of the proteins containing those patterns that occur most frequently are aligned on each other by a scoring method that obtains an average relatedness value for all the amino acids in each column of the aligned sequence block based on the Dayhoff relatedness odds matrix. The automated method successfully finds and displays nearly all of the sequence motifs that have been previously reported to occur in 33 reverse transcriptases, 18 DNA integrases, and 30 DNA methyltransferases.

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.1073/pnas.87.2.826

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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

Cites

Show all 2 references

Cited by

See all 203

Metadata

Authors
Smith, H. O., Annau, T. M., & Chandrasegaran, S.
Venue
Proceedings of the National Academy of Sciences
Published
1990-01
Volume
87
Issue
2
Pages
826-830
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W1971143006
Cited by
203
References
2
FWCI
6.35
Type
journal article
Language
en
Open access
green

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: Finding sequence motifs in groups of functionally related proteins. https://app.cochat.ai/papers/10.1073/pnas.87.2.826
The paper
Smith, H. O., Annau, T. M., & Chandrasegaran, S. (1990). Finding sequence motifs in groups of functionally related proteins. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.87.2.826

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.