Results 91 to 100 of about 7,293,468 (349)
From omics to AI—mapping the pathogenic pathways in type 2 diabetes
FEBS Letters, EarlyView.Integrating multi‐omics data with AI‐based modelling (unsupervised and supervised machine learning) identify optimal patient clusters, informing AI‐driven accurate risk stratification. Digital twins simulate individual trajectories in real time, guiding precision medicine by matching patients to targeted therapies.
Siobhán O'Sullivan +2 more
wiley +1 more source
Characterizing minimal point set dominating sets
AKCE International Journal of Graphs and Combinatorics, 2016 A set D of vertices in a graph G=(V,E) is said to be a point-set dominating set (or, in short, psd-set) of G if for every subset S of V−D there exists a vertex v∈D such that the subgraph 〈S∪{v}〉 is connected; the set of all psd-sets of G will be denoted ...
Purnima Gupta, Rajesh Singh, S. Arumugam
doaj +1 more source
On the independent dominating set polytope
European Journal of Combinatorics, 2006 AbstractIn this paper, we consider the independent dominating set polytope. We give a complete linear description of that polytope when the graph is reduced to a cycle. This description uses a general class of valid inequalities introduced in [T.M. Contenza, Some results on the dominating set polytope, Ph.D. Dissertation, University of Kentucky, 2000].
Mahjoub, A.R., Mailfert, Jean
openaire +4 more sources
Parity of an odd dominating set
Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 2022 For a simple graph $G$ with vertex set $V(G)=\{v_1,...,v_n\}$, we define the closed neighborhood set of a vertex $u$ as \\$N[u]=\{v \in V(G) \; | \; v \; \text{is adjacent to} \; u \; \text{or} \; v=u \}$ and the closed neighborhood matrix $N(G)$ as the matrix whose $i$th column is the characteristic vector of $N[v_i]$.
openaire +4 more sources
Location-domination in line graphs
, 2016 A set $D$ of vertices of a graph $G$ is locating if every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \cap D \neq N(v) \cap D$, where $N(u)$ denotes the open neighborhood
Foucaud, Florent, Henning, Michael A.
core +2 more sources
FEBS Letters, EarlyView.Knowing how proteases recognise preferred substrates facilitates matching proteases to applications. The S1′ pocket of protease EA1 directs cleavage to the N‐terminal side of hydrophobic residues, particularly leucine. The S1′ pocket of thermolysin differs from EA's at only one position (leucine in place of phenylalanine), which decreases cleavage ...
Grant R. Broomfield +3 more
wiley +1 more source
Exploring lipid diversity and minimalism to define membrane requirements for synthetic cells
FEBS Letters, EarlyView.Designing the lipid membrane of synthetic cells is a complex task, in which its various roles (among them solute transport, membrane protein support, and self‐replication) should all be integrated. In this review, we report the latest top‐down and bottom‐up advances and discuss compatibility and complexity issues of current engineering approaches ...
Sergiy Gan +2 more
wiley +1 more source
Eternal Independent Sets in Graphs
Theory and Applications of Graphs, 2016 The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection.
Yair Caro, William Klostermeyer
doaj +1 more source
FEBS Letters, EarlyView.The Arabidopsis mutants hls1 hlh1 and amp1 lamp1 exhibit pleiotropic developmental phenotypes. Although the functions of the causative genes remain unclear, they act in the same genetic pathway and are thought to generate non‐cell‐autonomous signals.
Takashi Nobusawa, Makoto Kusaba
wiley +1 more source
Edge Dominating Sets and Vertex Covers
Discussiones Mathematicae Graph Theory, 2013 Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering ...
Dutton Ronald, Klostermeyer William F.
doaj +1 more source