CoChat

A second calcineurin binding site on the NFAT regulatory domain

Open access
Park, Sheldon, Uesugi, Motonari, Verdine, Gregory L. · 2000 · Proceedings of the National Academy of Sciences
Cited by 95

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

Abstract

NFATc (a member of the family of nuclear factors of activated T cells) is a transcriptional factor responsible for the Ca 2+ -inducible activation of cytokine genes during the immune response. In resting T cells, NFATc is retained in the cytoplasm by a mechanism that depends on multiple phosphorylations in an N-terminal regulatory domain. Physical interaction with and dephosphorylation by Ca 2+ -activated calcineurin (Cn) allows the protein to enter the nucleus, where it binds to specific sites in cytokine gene promoters. Previous studies had identified a peptide segment in NFATc that binds Cn stably. Here we report the identification of a second Cn-binding element in NFATc, which synergizes with the previously identified element. Although these sequences are conserved in all isoforms of NFAT, we find that the two sites contribute differentially to the overall affinity for Cn in an isoform-dependent manner. The regulatory domain of NFAT also was found to be entirely devoid of structure, both in the phosphorylated and unphosphorylated state. This finding suggests that the NFAT regulatory domain does not undergo phosphorylation-induced conformational switching, but instead requires partner proteins to control accessibility of the NFAT nuclear localization and nuclear export signals.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1073/pnas.97.13.7130

Cites

4 of 4 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.

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.

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 4 references

Cited by

Metadata

Authors
Park, S., Uesugi, M., & Verdine, G. L.
Venue
Proceedings of the National Academy of Sciences
Published
2000-06-20
Volume
97
Issue
13
Pages
7130-7135
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W2042033660
Cited by
95
References
4
FWCI
2.14
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

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.