Results 81 to 90 of about 655,680 (212)
Single‐Nucleus RNA Sequencing Identifies CREM as a Brake on Myofiber Hypertrophy in Chickens
Single‐nucleus RNA sequencing on 91 144 nuclei from postnatal chicken pectoralis major between fast‐growing broilers (FG) and slow‐growing layers (SG) identifies the transcriptional factor CREM as a novel brake of myofiber hypertrophy. Mechanistically, functional validation experiments confirm that CREM activates the promoter of JUN and CREM deletion ...
Shuang Gu +12 more
wiley +1 more source
Chronic oral administration of specific probiotic strains triggers gut microbiota dysbiosis and systemic metabolic perturbations in mice. Multi‐omics profiling reveals subsequent hippocampal glial remodeling and neuroinflammation, which are linked to cognitive impairment.
Yibin Lin +15 more
wiley +1 more source
On powers and centers of chordal graphs
A graph is chordal if every cycle of length strictly greater than three has a chord. A necessary and sufficient condition is given for all powers of a chordal graph to be chordal. In addition, it is shown that for connected chordal graphs the center (the
Shier, Douglas, Laskar, Renu
core +1 more source
Craniofacial growth, modeling, and estimation of milestones
Abstract Understanding craniofacial growth is foundational for research into intra‐ and interspecies variation, evolution, and clinical care. The Craniofacial Growth Consortium Study (CGCS), combines cephalographs from historical growth studies to create a dense longitudinal record of growth from 6 to 22 years of age.
Richard J. Sherwood +6 more
wiley +1 more source
A new method for computing the vertex PI index with applications to special classes of graphs
The Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju +2 more
doaj +1 more source
Finding Biclique Partitions of Co-Chordal Graphs [PDF]
The biclique partition number $(\text{bp})$ of a graph $G$ is referred to as the least number of complete bipartite (biclique) subgraphs that are required to cover the edges of the graph exactly once.
Lyu, Bochuan, Hicks, Illya V.
core
pyFDRT is an open‐source tool that converts an impedance spectrum into a quantitative equivalent circuit. Its Fourier‐transform stage requires no discretization basis or regularization parameter, and the non‐negative refinement selects its own parameters, and an information criterion determines the relaxation process count.
Chung‐Yul Yoo +2 more
wiley +1 more source
Powers of the vertex cover ideal of a chordal graph
In this article, Cohen-Macaulay chordal graphs and generalized star graphs are studied to show that all powers of the vertex cover ideal of such graphs have linear quotients.
Mohammadi, Fatemeh, Fatemeh Mohammadi
core +1 more source
Do Banks in the Middle East and North Africa Region Price Carbon Exposure?
ABSTRACT This study examines whether carbon exposure is incorporated into corporate borrowing costs within the Middle East and North Africa (MENA) region. Using a panel of 771 firm‐year observations from publicly listed non‐financial firms between 2016 and 2023, the analysis investigates the relationship between carbon intensity and firms' cost of debt
Yara Ibrahim +2 more
wiley +1 more source
We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source

