Results 51 to 60 of about 115,985 (312)
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
Molecular bases of circadian magnesium rhythms across eukaryotes
FEBS Letters, EarlyView.Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley +1 more source
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
FEBS Letters, EarlyView.Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley +1 more source
Pathwidth and Nonrepetitive List Coloring
The Electronic Journal of Combinatorics, 2016 A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half receives the same sequence of colors as the second half. While every tree can be nonrepetitively colored with a bounded number of colors (4 colors is enough), Fiorenzi, Ochem, Ossona de Mendez, and Zhu recently showed that this does not extend to the list ...
Gagol, Adam +3 more
openaire +4 more sources
List-Coloring Claw-Free Graphs with $\Delta-1$ Colors [PDF]
SIAM Journal on Discrete Mathematics, 2017 Comment: 24 pages, 5 ...
Cranston, Daniel W., Rabern, Landon
openaire +2 more sources
FEBS Letters, EarlyView.Multidrug transporters BpeB and BpeF from the Gram‐negative pathogen Burkholderia pseudomallei have a hydrophilic patch in their substrate‐binding pocket. Drug susceptibility tests and growth curve analyses using an Escherichia coli recombinant expression system revealed that the hydrophilic patches of BpeB and BpeF are involved in the substrate ...
Ui Okada, Satoshi Murakami
wiley +1 more source
Function‐driven design of a surrogate interleukin‐2 receptor ligand
FEBS Letters, EarlyView.Interleukin (IL)‐2 signaling can be achieved and precisely fine‐tuned through the affinity, distance, and orientation of the heterodimeric receptors with their ligands. We designed a biased IL‐2 surrogate ligand that selectively promotes effector T and natural killer cell activation and differentiation. Interleukin (IL) receptors play a pivotal role in
Ziwei Tang +9 more
wiley +1 more source
Generalized Hypergraph Coloring
Discussiones Mathematicae Graph Theory, 2021 A smooth hypergraph property 𝒫 is a class of hypergraphs that is hereditary and non-trivial, i.e., closed under induced subhypergraphs and it contains a non-empty hypergraph but not all hypergraphs.
Schweser Thomas
doaj +1 more source
FEBS Letters, EarlyView.At low cell density, SETDB1 and YAP1 accumulate in the nucleus. As cell density increases, the Hippo pathway is gradually activated, and SETDB1 is associated with increased YAP1 phosphorylation. At high cell density, phosphorylated YAP1 is sequestered in the cytoplasm, while SETDB1 becomes polyubiquitinated and degraded by the ubiquitin–proteasome ...
Jaemin Eom +3 more
wiley +1 more source
Uniquely 2-list colorable graphs
Discrete Applied Mathematics, 2002 A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a theorem which characterizes uniquely 2-list colorable graphs.
Ganjali, Y.G. +4 more
openaire +2 more sources