Results 91 to 100 of about 1,156,434 (264)
Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura +2 more
wiley +1 more source
Neptune is a hash function proposed by Grassi et al. at ToSC 2022(3) for Zero-Knowledge (ZK) applications. In this note, we show that the linear layer of Neptune’s external rounds fails to guarantee the maximum growth of the degree, potentially ...
Matilda Urani, Lorenzo Grassi
doaj +1 more source
General scaling of maximum degree of synchronization in noisy complex networks
The effects of white noise and global coupling strength on the maximum degree of synchronization in complex networks are explored. We perform numerical simulations of generic oscillator models with both linear and non-linear coupling functions on a broad
Dominik Traxl +2 more
doaj +1 more source
Aggressive prostate cancer is associated with pericyte dysfunction
Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero +11 more
wiley +1 more source
ERRFI1, a neural crest (NC)‐associated gene, was upregulated in melanoma and negatively correlated with the expression of melanocytic differentiation markers and the susceptibility of melanoma cells toward BRAF inhibitors (BRAFi). Knocking down ERRFI1 significantly increased the sensitivity of melanoma cells to BRAFi.
Nina Wang +8 more
wiley +1 more source
Disjoint subgraphs of large maximum degree
The authors study the minimum size \(b(n,m)\) of a graph \(G=(V,E)\) such that for every partition \(V=A\cup B\) either \(\Delta(G[A])\geq n\) or \(\Delta(G[B])\geq m\) and the minimum size \(q(n,j,l)\) of a graph \(G=(V,E)\) having \(n+j+l\) vertices such that \(\Delta(G[A])\geq n\) for every set \(A\subseteq V\) with \(|A|=n+j\).
Pikhurko, Oleg, Thomason, Andrew
openaire +1 more source
We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck +12 more
wiley +1 more source
Effective therapeutic targeting of CTNNB1‐mutant hepatoblastoma with WNTinib
WNTinib, a Wnt/CTNNB1 inhibitor, was tested in hepatoblastoma (HB) experimental models. It delayed tumor growth and improved survival in CTNNB1‐mutant in vivo models. In organoids, WNTinib outperformed cisplatin and showed enhanced efficacy in combination therapy, supporting its potential as a targeted treatment for CTNNB1‐mutated HB.
Ugne Balaseviciute +17 more
wiley +1 more source
On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two
In this note, we give an easy and short proof for the theorem by Park and Kim stating that the hypercompetition numbers of hypergraphs with maximum degree at most two is at most two.
Sano Yoshio
doaj +1 more source
Sum labelling graphs of maximum degree two
The concept of sum labelling was introduced in 1990 by Harary. A graph is a sum graph if its vertices can be labelled by distinct positive integers in such a way that two vertices are connected by an edge if and only if the sum of their labels is the label of another vertex in the graph.
Henning Fernau, Kshitij Gajjar
openaire +2 more sources

