Results 51 to 60 of about 41,117 (251)

On the approximability of the maximum induced matching problem [PDF]

open access: yes, 2005
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele   +12 more
core   +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

Strong chromatic index of claw-free graphs with edge weight seven [PDF]

open access: yes, 2023
Let $G$ be a graph and $k$ a positive integer. A strong $k$-edge-coloring of $G$ is a mapping $\phi: E(G)\to \{1,2,...,k\}$ such that for any two edges $e$ and $e^'$ that are either adjacent to each other or adjacent to a common edge, $\phi(e)\ne \phi(e^'
Wensong Lin   +3 more
core   +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

Strong List Edge Coloring of Subcubic Graphs [PDF]

open access: yes, 2020
We study strong list edge coloring of subcubic graphs, and we prove that every subcubic graph with maximum average degree less than 15/7, 27/11, 13/5, and 36/13 can be strongly list edge colored with six, seven, eight, and nine colors ...
Zhengke Miao   +4 more
core  

Sliding window temporal graph coloring [PDF]

open access: yes, 2021
Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching.
Mertzios, George B   +5 more
core   +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

Conserved binding mode but diverse interfaces of MreC‐PBP2 interactions

open access: yesFEBS Letters, EarlyView.
The crystal structure of abMreC reveals a conserved two β‐barrel architecture and provides structural insights into its role within the bacterial elongasome. The abMreC–abPBP2 complex model identifies the molecular basis of MreC‐mediated PBP2 recognition, contributing to the regulation of peptidoglycan synthesis.
Hyunseok Jang   +4 more
wiley   +1 more source

AscF in the mycobacterial CIII–CIV supercomplex lacks metal and nucleotide binding but links malate oxidation to respiration

open access: yesFEBS Letters, EarlyView.
The mycobacterial CIII‐CIV respiratory supercomplex is an obligate assembly, encompassing several subunits of unknown functions. We have characterized the intracellular subunit AscF, and show that it is unlikely to be a sensor for metals or nucleotides, but is required for growth on nonfermentable energy sources, and likely works as an adapter for ...
Eni Rile   +8 more
wiley   +1 more source

Large rainbow matchings in semi-strong edge-colorings of graphs [PDF]

open access: yes, 2018
The lower bounds for the size of maximum rainbow matching in properly edge-colored graphs have been studied deeply during the last decades. An edge-coloring of a graph [Formula: see text] is called a strong edge-coloring if each path of length at most ...
Zemin Jin, Kun Ye, He Chen, Yuefang Sun
core   +1 more source

Home - About - Disclaimer - Privacy