28 research outputs found
Autophosphorylation of DNA-PKCS regulates its dynamics at DNA double-strand breaks
The DNA-dependent protein kinase catalytic subunit (DNA-PKCS) plays an important role during the repair of DNA double-strand breaks (DSBs). It is recruited to DNA ends in the early stages of the nonhomologous end-joining (NHEJ) process, which mediates DSB repair. To study DNA-PKCS recruitment in vivo, we used a laser system to introduce DSBs in a specified region of the cell nucleus. We show that DNA-PKCS accumulates at DSB sites in a Ku80-dependent manner, and that neither the kinase activity nor the phosphorylation status of DNA-PKCS influences its initial accumulation. However, impairment of both of these functions results in deficient DSB repair and the maintained presence of DNA-PKCS at unrepaired DSBs. The use of photobleaching techniques allowed us to determine that the kinase activity and phosphorylation status of DNA-PKCS influence the stability of its binding to DNA ends. We suggest a model in which DNA-PKCS phosphorylation/autophosphorylation facilitates NHEJ by destabilizing the interaction of DNA-PKCS with the DNA ends
Patient outcomes of monotherapy with hypofractionated three-dimensional conformal radiation therapy for stage T2 or T3 non-small cell lung cancer: a retrospective study
Lights out game with cellular automation
We will figure out when graphs are solvable in the Lights Out game and what graphs can have any initial configurations which are solvable. We will observe wheel, cycle, path, Km,n and join graphs. We will apply the Rule 90 in cellular automaton to cycle graphs. The Rule 90 in cellular automaton behaves like pushing “on” vertices automatically. Since configurations on cycle graphs change with time (steps) by the cellular automaton’s rule, we will consider what kind of cycle graphs and initial states can be solvable after finitely many steps. Solvable here means all vertices become “off”
Lights out game with cellular automation
We will figure out when graphs are solvable in the Lights Out game and what graphs can have any initial configurations which are solvable. We will observe wheel, cycle, path, Km,n and join graphs. We will apply the Rule 90 in cellular automaton to cycle graphs. The Rule 90 in cellular automaton behaves like pushing “on” vertices automatically. Since configurations on cycle graphs change with time (steps) by the cellular automaton’s rule, we will consider what kind of cycle graphs and initial states can be solvable after finitely many steps. Solvable here means all vertices become “off”
Compensation of the Model Error in the Communication Disturbance Observer on the Time-Delay System
Water intoxication in adult cattle
Water intoxication is a common disorder in calves and is usually characterized by transient hemoglobinuria. In contrast, the condition is very rare in adult cattle, with few reports on naturally occurring cases. In the present report, four female Japanese Black cattle, aged 16-25 months, showed neurological signs when they drank water following a water outage. Hemoglobinuria was not grossly observed, while severe hyponatremia was revealed by laboratory tests. Autopsy indicated cerebral edema with accumulation of serous fluid in expanded Virchow-Robin spaces. These results indicate the possibility of water intoxication associated with cerebral edema due to severe dilutional hyponatremia in adult cattle