CoChat

A high‐throughput method to identify trans‐activation domains within transcription factor sequences

Open access
Arnold, Cosmas D, Nemčko, Filip, Woodfin, Ashley R, Wienerroither, Sebastian, Vlasova, Anna, Schleiffer, Alexander, Pagani, Michaela, Rath, Martina, Stark, Alexander · 2018 · The EMBO Journal
Cited by 64

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

Abstract

Abstract Even though transcription factors (TFs) are central players of gene regulation and have been extensively studied, their regulatory trans ‐activation domains (tADs) often remain unknown and a systematic functional characterization of tADs is lacking. Here, we present a novel high‐throughput approach tAD‐seq to functionally test thousands of candidate tADs from different TFs in parallel. The tADs we identify by pooled screening validate in individual luciferase assays, whereas neutral regions do not. Interestingly, the tADs are found at arbitrary positions within the TF sequences and can contain amino acid (e.g., glutamine) repeat regions or overlap structured domains, including helix–loop–helix domains that are typically annotated as DNA‐binding. We also identified tADs in the non‐native reading frames, confirming that random sequences can function as tADs, albeit weakly. The identification of tADs as short protein sequences sufficient for transcription activation will enable the systematic study of TF function, which—particularly for TFs of different transcription activating functionalities—is still poorly understood.

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.15252/embj.201798896

Cites

15 of 15 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

Cited by

See all 64

Metadata

Authors
Arnold, C. D., Nemčko, F., Woodfin, A. R., Wienerroither, S., Vlasova, A., Schleiffer, A., Pagani, M., Rath, M., & Stark, A.
Venue
The EMBO Journal
Published
2018-07-13
Volume
37
Issue
16
ISSN
  • 0261-4189 (ISSN-L)
  • 1460-2075
OpenAlex
W2884096756
Cited by
64
References
15
FWCI
1.80
Type
journal article
Language
en
Open access
hybrid

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.