Results 101 to 110 of about 855,405 (264)

The role and implications of mammalian cellular circadian entrainment

open access: yesFEBS Letters, EarlyView.
At their most fundamental level, mammalian circadian rhythms occur inside every individual cell. To tell the correct time, cells must align (or ‘entrain’) their circadian rhythm to the external environment. In this review, we highlight how cells entrain to the major circadian cues of light, feeding and temperature, and the implications this has for our
Priya Crosby
wiley   +1 more source

Hermitian geometry on resolvent set(I)

open access: yes, 2016
For a tuple $A=(A_1,\ A_2,\ ...,\ A_n)$ of elements in a unital Banach algebra ${\mathcal B}$, its projective joint spectrum $P(A)$ is the collection of $z\in {\mathbb C}^n$ such that $A(z)=z_1A_1+z_2A_2+\cdots +z_nA_n$ is not invertible. It is known that the ${\mathcal B}$-valued $1$-form $ _A(z)=A^{-1}(z)dA(z)$ contains much topological information ...
Douglas, Ronald G., Yang, Rongwei
openaire   +2 more sources

Molecular bases of circadian magnesium rhythms across eukaryotes

open access: yesFEBS 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

Graphs with distinguishing sets of size k

open access: yesKuwait Journal of Science
The size of a resolving set R of a non-trivial connected graph Γ of order n ≥ 2 is the number of edges in the induced subgraph .The minimum cardinality of a resolving set of size k of graph Γ is called the metric dimension of size k, denoted by β(k)(Γ ...
Muhammad Naeem Azhar   +3 more
doaj   +1 more source

Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10

open access: yesFEBS Letters, EarlyView.
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang   +8 more
wiley   +1 more source

Metric dimension of star fan graph

open access: yesScientific Reports
Every node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set.
S. Prabhu   +2 more
doaj   +1 more source

Investigating computational models of perceptual attack time [PDF]

open access: yes, 2006
The perceptual attack time (PAT) is the compensation for differing attack components of sounds, in the case of seeking a perceptually isochronous presentation of sounds. It has applications in scheduling and is related to, but not necessarily the same as,
Collins, Nick
core   +2 more sources

Set-Valued Resolvent Equations and Mixed Variational Inequalities

open access: yesJournal of Mathematical Analysis and Applications, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aslam, Noor Muhammad   +2 more
openaire   +1 more source

Interplay between circadian and other transcription factors—Implications for cycling transcriptome reprogramming

open access: yesFEBS Letters, EarlyView.
This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley   +1 more source

Metric dimension of dual polar graphs

open access: yes, 2017
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$.
Bailey, Robert F., Spiga, Pablo
core  

Home - About - Disclaimer - Privacy