Results 141 to 150 of about 10,268,798 (293)
A Characterization of Trees for a New Lower Bound on the K-Independence Number
Discussiones Mathematicae Graph Theory, 2013 Let k be a positive integer and G = (V,E) a graph of order n. A subset S of V is a k-independent set of G if the maximum degree of the subgraph induced by the vertices of S is less or equal to k − 1. The maximum cardinality of a k-independent set of G is
Meddah Nacéra, Blidia Mostafa
doaj +1 more source
Molecular Oncology, EarlyView.Breast cancer remains a major cause of cancer death in women, frequently developing endocrine therapy resistance. This study demonstrates that upregulated p21‐activated kinase 1 (PAK1) activity drives resistance to tamoxifen and long‐term estrogen deprivation in ER+ breast cancer models.
Luisa Schwarzmüller +10 more
wiley +1 more source
Surface- Based Computing Model of Maximum Independent Set Problem
, 2011 About thirty years ago, the concept of the complexity of the problem was proposed. The most important complex class is P and NP class. Fruitful results of this concept are the existence of the so-called complex class complete problem. If the other issues
Zhi Xiang Yin, Yan Yang
core +1 more source
Molecular Oncology, EarlyView.Drug resistance limits treatment success in a subset of lung cancers driven by ROS1 gene alterations. Using patient‐derived cells and computer simulations, we studied three key mutations and how they affect five targeted drugs. The mutations reduced drug effectiveness in different ways by altering protein structure and behavior.
Farhan Ul Haq +8 more
wiley +1 more source
Molecular Oncology, EarlyView.Circulating microRNAs as biomarkers of cachexia and sex‐specific cancer in senior dogs. In 25 client‐owned dogs, four circulating miRNAs (miR‐15a, miR‐15b, miR‐16, miR‐140) were downregulated in cachexia, with miR‐16 the strongest individual biomarker (AUC = 0.899).
Soon‐Seok Park +6 more
wiley +1 more source
A remark on the weak Turan's Theorem [PDF]
Computer Science Journal of Moldova, 2017 A subset $S$ of vertices of a graph $G$ is an \textit{independent set} if no pair of vertices of $S$ are adjacent. The \textit{independence number}, $\alpha(G)$ of $G$, is the maximum cardinality of an independent set of $G$.
Nader Jafari Rad
doaj
Molecular Oncology, EarlyView.LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang +9 more
wiley +1 more source
Molecular Oncology, EarlyView.Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
Pharmacological chromatin remodeling enhances response to estrogen therapy in ER+ breast cancer
Molecular Oncology, EarlyView.Estrogen therapy elicits clinical benefit in ~ 30% of patients with endocrine‐resistant estrogen receptor (ER)‐positive breast cancer. Based on findings that ER transcriptional activation underlies response to estrogen therapy, we tested the effects of epigenetic dysregulation via pharmacological inhibition of histone deacetylases (HDACi).
Anneka L. Johnson Thomas +16 more
wiley +1 more source
A Variant of the Maximum Weight Independent Set Problem
CoRR, 2014 We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph $G=(V,E)$, a weight function $w: V \rightarrow \mathbb{R^+}$, a budget function $b: V \rightarrow \mathbb{Z^+}$, and a positive integer $B$. The weight (resp.
openaire +2 more sources