Results 91 to 100 of about 8,369 (289)
FEBS 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
An induced subgraph characterization of domination perfect graphs [PDF]
, 1995 Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectively. A graph (G) is called domination perfect if γ(H) = ι(H), for every induced subgraph H of (G).
Vadim E. Zverovich +5 more
core +1 more source
Independent strong weak domination: A mathematical programming approach [PDF]
, 2020 Let G = (V, E) be a graph. A subset S subset of V of vertices is a dominating set if every vertex in V - S is adjacent to at least one vertex of S. The domination number is the minimum cardinality of a dominating set. Let u, v is an element of V. Then, u
Uğurlu, Onur +2 more
core +1 more source
An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes
FEBS Letters, EarlyView.GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg +14 more
wiley +1 more source
Independent Domination in Complementary Prisms [PDF]
, 2013 The complementary prism of a graph G is the graph formed from a disjoint union of G and its complement ̄G by adding the edges of a perfect matching between the corresponding vertices of G and G.
Haynes, Teresa W. +2 more
core
Independent Domination In Planar Graph [PDF]
, 2021 A dominating set D of a planar graph G is an independent dominating set Dip if D is noth independent and dominating set. The authors have generated the maximum independent dominating number of planar graph ( IP ) and minimum independent dominating ...
N. Subashini
core
Computational Complexity of Outer-Independent Total and Total Roman Domination Numbers in Trees
IEEE Access, 2018 An outer-independent total dominating set (OITDS) of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V (G) \ D is independent.
Zepeng Li +4 more
doaj +1 more source
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Unique irredundance, domination and independent domination in graphs [PDF]
, 2005 A subset D of the vertex set of a graph G is irredundant if every vertex v in D has a private neighbor with respect to D, i.e. either v has a neighbor in V(G)⧹D that has no other neighbor in D besides v or v itself has no neighbor in D.
Igor Zverovich +6 more
core +1 more source
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source