Results 91 to 100 of about 423,962 (267)

PAK1 activation drives divergent resistance mechanisms to aromatase inhibition and tamoxifen in a luminal: A breast cancer model

open access: yesMolecular 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

Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search

open access: yesEntropy
Quantum walks are a powerful framework for simulating complex quantum systems and designing quantum algorithms, particularly for spatial search on graphs, where the goal is to find a marked vertex efficiently.
Renato Portugal, Jalil Khatibi Moqadam
doaj   +1 more source

Completely connected clustered graphs

open access: yesJournal of Discrete Algorithms, 2003
A clustered graph \((G,T,r)\) consists of a graph \(G=(V,E)\), a tree \(T\), and an inner vertex \(r\) of \(T\) such that the set of leaves of \(T\) is exactly \(V\). A clustered graph is said to be completely connected if every cluster, and also each complement of a cluster, induces a connected subgraph.
Sabine Cornelsen, Dorothea Wagner
openaire   +2 more sources

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

open access: yesMolecular Oncology, EarlyView.
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur   +11 more
wiley   +1 more source

Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph

open access: yesIEEE Access, 2018
In this paper, we have proposed altogether different and new approaches for the computation of all possible spanning trees of a simple, undirected, and connected graph.
Maumita Chakraborty   +2 more
doaj   +1 more source

ZW4864‐mediated inhibition of the β‐catenin/BCL9/BCL9L complex reveals therapeutic potential in bladder cancer

open access: yesMolecular Oncology, EarlyView.
BCL9 and BCL9L drive bladder cancer progression by enhancing β‐catenin signaling, promoting proliferation, migration, invasion, and organoid growth. Genetic depletion of BCL9(L) suppresses malignant phenotypes, while pharmacological disruption of the β‐catenin/BCL9(L) complex with ZW4864 inhibits canonical Wnt signaling and tumor‐associated cellular ...
Roland Kotolloshi   +11 more
wiley   +1 more source

Translating whole‐genome doubling into precision medicine in cancer

open access: yesMolecular Oncology, EarlyView.
Whole‐genome doubling creates a WGD‐positive tumor state characterized by persistent chromosomal instability, karyotypic diversification, and cellular stress. These same biological pressures drive aggressive tumor evolution while exposing therapeutic vulnerabilities, providing a rationale for WGD‐informed precision medicine. Whole‐genome doubling (WGD)
Sejung Lee, Junghyeok Lim, Jinhyuk Bhin
wiley   +1 more source

Single‐cell DNA methylation profiling: Technologies, computation, and applications in precision oncology

open access: yesMolecular 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

Degree complete graphs

open access: yesDiscrete Mathematics, 2006
Let \(S= (S_1,\dots, S_n)\) be an out-degree vector of an orientation of a graph \(G\) with vertices \(1,\dots, n\). According to the partial order \(\succeq\) on the nonnegative integral vectors [see \textit{H. J. Ryser}, J. Algebra 10, 246--261 (1968; Zbl 0167.28001)] \(S^r_G\succeq S\succeq S^l_G\), \(\sum^n_{i=1} s_i= |E(G)|\) and \(0\leq s_i\leq ...
openaire   +3 more sources

Home - About - Disclaimer - Privacy