CoChat

Hairpins are formed by the single DNA strands of the fragile X triplet repeats: structure and biological implications.

Open access
Chen, X, Mariappan, S V, Catasti, P, Ratliff, R, Moyzis, R K, Laayoun, A, Smith, S S, Bradbury, E M, Gupta, G · 1995 · Proceedings of the National Academy of Sciences
Cited by 227

The DOI matches its Crossref record.

Abstract

Inordinate expansion and hypermethylation of the fragile X DNA triplet repeat, (GGC)n.(GCC)n, are correlated with the ability of the individual G- and C-rich single strands to form hairpin structures. Two-dimensional NMR and gel electrophoresis studies show that both the G- and C-rich single strands form hairpins under physiological conditions. This propensity of hairpin formation is more pronounced for the C-rich strand than for the G-rich strand. This observation suggests that the C-rich strand is more likely to form hairpin or "slippage" structure and show asymmetric strand expansion during replication. NMR data also show that the hairpins formed by the C-rich strands fold in such a way that the cytosine at the CpG step of the stem is C.C paired. The presence of a C.C mismatch at the CpG site generates local flexibility, thereby providing analogs of the transition to the methyltransferase. In other words, the hairpins of the C-rich strand act as better substrates for the human methyltransferase than the Watson-Crick duplex or the G-rich strand. Therefore, hairpin formation could account for the specific methylation of the CpG island in the fragile X repeat that occurs during inactivation of the FMR1 gene during the onset of the disease.

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.92.11.5199

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.

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

Cited by

Metadata

Authors
Chen, X., Mariappan, S. V., Catasti, P., Ratliff, R., Moyzis, R. K., Laayoun, A., Smith, S. S., Bradbury, E. M., & Gupta, G.
Venue
Proceedings of the National Academy of Sciences
Published
1995-05-23
Volume
92
Issue
11
Pages
5199-5203
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W2025133427
Cited by
227
References
0
FWCI
13.59
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.