ArticleAdvances in biological chemistry2013
Rad51 ATP binding but not hydrolysis is required to recruit Rad10 in synthesis-dependent strand annealing sites in
Article in Advances in biological chemistry, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed, 1 citations in OpenAlex.
- Saw1 localizes to repair sites but is not required for recruitment of Rad10 to repair intermediates bearing short non-homologous 3' flaps during single-strand annealing in S. cerevisiae.Molecular and cellular biochemistry · 2016Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors at 1 institution in 1 country.
Funding
Abstract
Several modes of eukaryotic of DNA double strand break repair (DSBR) depend on synapsis of complementary DNA. The Rad51 ATPase, the
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.