Results 31 to 40 of about 3,872,853 (232)
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
, 2011 Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core
FEBS Letters, EarlyView.How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +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
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
The Strong Edge-Coloring of Graphs [PDF]
A proper edge-coloring of a graph G is called a strong edge-coloring if any two edges joined by another edge receive distinct colors. It is clear that in a strong edge-coloring, every color class forms an induced matching.
Zhou, Xiangqian
core +1 more source
Strong Edge Coloring of Cayley Graphs and Some Product Graphs
, 2022 A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index.
Tuza, Zsolt +3 more
core +1 more source
Molecular Oncology, EarlyView.Pair‐wise comparison of the CellSearch and FETCH enrichment technologies for circulating tumor cells (CTCs) from metastatic breast, prostate, and small cell lung cancer patients shows an increased capture of CTCs using FETCH enrichment. The clinical implementation of circulating tumor cells (CTCs) as a predictive tool for therapy efficacy in the ...
Michiel Stevens +6 more
wiley +1 more source
Strong Rainbow Edge Coloring of Some Interconnection Networks [PDF]
, 2015 A rainbow edge coloring of a connected graph is a coloring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are colored the same.
Arputhamary, I. Annammal +1 more
core +1 more source
Molecular Oncology, EarlyView.We identify USP29 as the only DUB mirroring CA9 expression, a marker of hypoxia and HIF pathway activation associated with PCA aggressiveness. USP29 stabilizes HIF‐1α and HIF‐2α via a noncanonical mechanism that is independent of PHD/pVHL activity yet relies on proteasomal regulation, establishing USP29 as a previously unrecognized regulator of hypoxic
Amelie S Schober +16 more
wiley +1 more source
, 2021 Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge ...
M. Sundarakannan +2 more
core +1 more source