Results 131 to 140 of about 1,814,953 (245)
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
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
Graph layout using subgraph isomorphisms [PDF]
Today, graphs are used for many things. In engineering, graphs are used to design circuits in very large scale integration. In computer science, graphs are used in the representation of the structure of software. They show information such as the flow of
Hofton, A.E., Hofton, Antony Edward
core
Exploiting planarity in separation routines for the symmetric travelling salesman problem [PDF]
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut.
Pearson, N, Letchford, A N
core +2 more sources
In a murine model of myocardial ischemia and reperfusion (MI/R), the CD36 azapeptide ligand MPE‐298 reduces cardiac injury and transiently lowers left ventricular long‐chain fatty acids (LCFAs) accumulation 3 h after reperfusion, accompanied by a decrease of oxidative stress and inflammation‐associated genes' expression in the heart and adipose tissue.
Jade Gauvin +12 more
wiley +1 more source
Graph Homomorphism Revisited for Graph Matching [PDF]
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Evaluating the involvement of autolysosomes in the nuclear translocation of fluorescent proteins
Endogenously expressed fluorescent proteins can be degraded by autophagy and transported to cell nuclei via the nuclear pore complex. But in some cell lines, for example, HeLa cells which are positive for immunoreactivity of a receptor ligand, such as UCN I, in cell nuclei, fusion of autolysosome with the nuclear envelope is involved in the nuclear ...
Keiichi Ikeda
wiley +1 more source
The cytoskeleton‐mediated transport of mitochondria via tunnelling nanotubes restores respiration, increases ATP production, rescues cells from apoptosis, activates the AKT/mTOR signalling pathway, promotes cell migration and invasiveness, contributes to cancer progression and treatment resistance.
Stanislava Martínková, Jan Trnka
wiley +1 more source
Repair of neuronal DNA damage in Alzheimer's disease by KCL‐286. (A) Amyloid‐β oligomers and plaques impair neuronal DNA repair pathways, leading to DNA double‐strand breaks and glial activation. (B) KCL‐286 activates RARβ/RXR signalling via retinoic acid response elements (RAREs), associated with increased BRCA1 expression, enhanced DNA repair and ...
Natasha Hill +6 more
wiley +1 more source
Classes of bipartite graphs related to chordal graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

