Results 121 to 130 of about 119,419 (266)

Cycle-regular graphs

Discrete Mathematics, 1991
AbstractH.M. Mulder introduced (0,λ)-graphs and proved that maximum (0,λ)-graphs are hypercubes. One way of generalization of this concept is to consider cycle-regular graphs. We prove that these graphs have also some regularity properties and that maximum [3, 1, 6]-cycle regular graphs are also related to hypercubes.
openaire   +1 more source

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

FEBS Open Bio, EarlyView.
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong, Yuhei Hosokawa, Lars Oliver Essen, Manuel Maestre‐Reyna   +3 more
wiley   +1 more source

Time‐restricted feeding prior to Mycobacterium tuberculosis infection reduces tissue CD4+ T cells with limited impact on bacterial clearance

FEBS Open Bio, EarlyView.
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, Nidhi Yadav, Subhasmita Das, R. Rajendra Kumar Reddy, Nupur Sharma, Amol Ratnakar Suryawanshi, Jaswinder Singh Maras, Ranjan Kumar Nanda   +7 more
wiley   +1 more source

Factors of regular graphs

Journal of Combinatorial Theory, Series B, 1986
A spanning subgraph F of a graph G is called a [k-1,k]-factor if \(k-1\leq d_ F(x)\leq k\) for all vertices of x of G, where \(d_ F(x)\) denotes the degree of x in F. \textit{W. T. Tutte} [The subgraph problem, Ann. Discrete Math. 3, 289-295 (1978; Zbl 0377.05034)] proved that if r is an odd integer, then every r-regular graph has a [k-1,k]-factor for ...
openaire   +3 more sources

Cyclic azapeptide CD36 ligand attenuates cardiac injury and reduces long‐chain fatty acid accumulation after myocardial ischemia–reperfusion in mice

FEBS Open Bio, EarlyView.
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, Naghme Radmannia, David N. Huynh, Liliane Ménard, Caroline Daneault, Maïté Veilleux, Ahsanullah Ahsanullah, André C. Carpentier, William D. Lubell, Matthieu Ruiz, Huy Ong, Sylvie Marleau, Simon‐Pierre Gravel   +12 more
wiley   +1 more source

Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA

FEBS Open Bio, EarlyView.
PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro, Fernando Lucas Palhano   +1 more
wiley   +1 more source

Hyperosmotic stress‐induced redistribution of pre‐mRNA cleavage factor I subunits is associated with shifts in alternative polyadenylation

FEBS Open Bio, EarlyView.
Hyperosmotic stress triggers the relocation of the CFIm complex from the nucleus to the cytoplasm. This shift creates a nuclear ‘stoichiometric bottleneck’, limiting CFIm availability for mRNA processing. Consequently, specific mRNAs like NUDT21 and DICER1 undergo targeted 3′UTR shortening, demonstrating how spatial protein dynamics drive rapid ...
Hitomi Soumiya, Masatake Osawa, Hidefumi Fukumitsu   +2 more
wiley   +1 more source

On distance-regularity in graphs

Journal of Combinatorial Theory, Series B, 1982
AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on the same vertex set in which a pair of vertices is adjacent if and only if their distance apart is i in G. If G is distance-regular, then Ai is a polynomial of degree i in A. It is shown that the converse is also true.
openaire   +1 more source

Evaluating the involvement of autolysosomes in the nuclear translocation of fluorescent proteins

FEBS Open Bio, EarlyView.
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

ALDOA Promotes Glycolysis and NLRP3/GSDMD Pyroptosis to Accelerate ALS Progression

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Amyotrophic lateral sclerosis (ALS) is characterized by progressive motor neuron degeneration. Glycolytic dysregulation is implicated in disease progression, yet the underlying mechanisms remain unclear. This study investigates how Aldolase A (ALDOA) drives ALS progression through glycolysis‐mediated motor neuron pyroptosis.
Kaixin Yan, Yan Jiang, Yuxuan Yong, Tianshuo Zhang, Niannian Zhang, Qianqian Zeng, Xue Gong, Li Meng, Fangfang Bi, Yongmin Liu   +9 more
wiley   +1 more source