Results 101 to 110 of about 1,191,800 (264)

On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree

open access: yesJournal of Applied Mathematics, 2014
The Wiener polarity index of a connected graph G is defined as the number of its pairs of vertices that are at distance three. By introducing some graph transformations, in different way with that of Huang et al., 2013, we determine the minimum Wiener ...
Jianping Ou, Xing Feng, Saihua Liu
doaj   +1 more source

Cell geometry and membrane protein crowding constrain Escherichia coli growth rate, overflow metabolism, respiration, and maintenance energy

open access: yesFEBS Letters, EarlyView.
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson   +6 more
wiley   +1 more source

Electron transfer between complexes III and IV in S. cerevisiae mitochondrial membranes

open access: yesFEBS Letters, EarlyView.
Mitochondrial oxidative phosphorylation in S. cerevisiae mitoplasts is limited by complex IV catalytic capacity, rather than two‐dimensional cytochrome c diffusion. At physiological cytochrome c : supercomplex ratios at salinity equivalent to that of 20 mm monovalent salt, activity is maximized, indicating that this low ionic strength accurately mimics
Ana Paula Lobez   +2 more
wiley   +1 more source

Extremal trees for the geometric-arithmetic index with the maximum degree [PDF]

open access: yesDiscrete Mathematics Letters, 2022
A. Divya, A. Manimaran
doaj   +1 more source

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

Phosphoinositides and inositol phosphates as molecular glues

open access: yesFEBS Letters, EarlyView.
Inositol phosphates (IPs) and phosphoinositides (PIPs) regulate diverse eukaryotic processes. Beyond recruiting signaling proteins or acting as structural cofactors, recent studies suggest they mediate protein–protein interactions as natural molecular glues.
Aleshia Seaton‐Terry   +9 more
wiley   +1 more source

Three phosphatase families form a community: The phosphohydrolases that act upon inositol pyrophosphates

open access: yesFEBS Letters, EarlyView.
Inositol pyrophosphates are energy‐rich signaling molecules that perform critical functions in cells. Three different families of phosphatases hydrolyze the β phosphate of the inositol pyrophosphate molecules: two have narrow specificities and one is promiscuous.
Ronda J. Rolfes
wiley   +1 more source

Modelling stem cell differentiation related processes—A practical overview for biologists

open access: yesFEBS Letters, EarlyView.
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar   +4 more
wiley   +1 more source

Reconstructing enzyme evolution by protein engineering

open access: yesFEBS Letters, EarlyView.
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler   +2 more
wiley   +1 more source

Independence in graphs with maximum degree four

open access: yesJournal of Combinatorial Theory, Series B, 1984
Let C be the class of triangle-free graphs with maximum degree 4. We derive the lower bound \(q\geq 6p-13\beta\) where q is the number of edges, p is the number of vertices, and \(\beta\) is the independence of a graph in C. The proof is by induction and involves several rather complicated lemmas.
openaire   +3 more sources

Home - About - Disclaimer - Privacy