Results 71 to 80 of about 1,503,165 (299)
Arginine methylation can be viewed as a persistence‐prone post‐translational modification regulated by a network of PRMTs. Competitive and compensatory interactions among PRMTs can redistribute methylation across substrate pools shaped by sequence, structural, spatial, and environmental layers, reinforcing RNA‐processing, chromatin, and signaling ...
So Hyun Kwon, Ji Min Lee
wiley +1 more source
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler +5 more
core +1 more source
Gut microbiota alterations in patients with non‐small‐cell lung cancer undergoing chemoradiotherapy
We investigated the impact of concurrent chemoradiotherapy (CRT) on the gut microbiota in patients with locally advanced non‐small‐cell lung cancer. Overall gut microbiota composition remained largely stable throughout CRT while antibiotic exposure may influence microbial diversity.
Hanne Marte Nymoen +19 more
wiley +1 more source
Interval Graphs are Reconstructible
39 pages, 1 ...
Irene Heinrich +3 more
openaire +2 more sources
Isocitrate dehydrogenase 1 (IDH1) mutations are highly recurrent in multiple human cancer types, including cholangiocarcinoma and glioma. IDH1 R132C is the most common IDH1 mutation in cholangiocarcinoma and likely arises from APOBEC3A‐ or APOBEC3B‐mediated deamination.
Kelly E. Butler +3 more
wiley +1 more source
Weakly toll convexity and proper interval graphs [PDF]
A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$ of vertices of $G$ is {\it weakly toll convex} if for any two non-adjacent vertices $x,y \in S$
Mitre C. Dourado +3 more
doaj +1 more source
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
Algorithms for optimal min hop and foremost paths in interval temporal graphs
Path problems are fundamental to the study of graphs. Temporal graphs are graphs in which the edges connecting the vertices change with time. Min hop paths problem in a temporal graph is the problem of finding time respecting paths from source vertex to ...
Anuj Jain, Sartaj K. Sahni
doaj +1 more source
An evolution of interval graphs
A random interval is defined as \([x-e,x+e]\) with x chosen uniformly in [0,1] and e chosen uniformly in [0,r] where r is a parameter. The interval graph of n such intervals has n points, any pair of which is connected if the two interval overlap. The evolution of an interval graph gives an idea of how the expected properties of the graph change with ...
openaire +2 more sources
Time‐restricted feeding (TRF) in mice increased liver fatty acid oxidation and decreased fatty acid biosynthesis. These alterations persisted when TRF was discontinued and the host was infected with Mycobacterium tuberculosis. Pre‐exposure to TRF did not alter tissue (lung and spleen) mycobacterial burden but significantly reduced CD3+ T cells in lungs
Ashish Gupta +7 more
wiley +1 more source

