Results 71 to 80 of about 112,189 (262)
Известия Томского политехнического университета: Инжиниринг георесурсов, 2019 The relevance of the research is caused by the unsolved problem of searching for the complete graph invariant and polynomial algorithm for its computing.
V. K. Pogrebnoy, A. V. Pogrebnoy
doaj +2 more sources
Finding novel vulnerabilities of hypomorphic BRCA1 alleles
Molecular Oncology, EarlyView.Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder +10 more
wiley +1 more source
MITF maintains genome stability in nonmelanocyte lineages
Molecular Oncology, EarlyView.MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir +13 more
wiley +1 more source
Molecular Oncology, EarlyView.The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source
On the Complexity of Embedding in Graph Products
Computing in Geometry and TopologyGraph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph G in a host graph that is the strong product of a path ...
Therese Biedl +2 more
doaj +1 more source
Polish Maritime Research, 2018 The research work in this paper belongs to the application of granular computing, graph theory and its application in fault detection and diagnosis. It is a cross cutting and frontier research field in computer science, information science and graph ...
Zhu Ying, Geng Liang
doaj +1 more source
Distributed Algorithm for Tolerance Relation Rough Sets Based on Graph Optimization [PDF]
Jisuanji gongchengResearchers have introduced the theory of tolerance relation rough sets to address the data filtering problem in distributed Incomplete Information Systems (IIS).
WU Zhengjiang, WU Xingchen, LIAN Tao, WANG Mengsong
doaj +1 more source
Searching for metastable particles using graph computing. [PDF]
Sci Rep, 2021 Kotwal AV.
europepmc +1 more source
Oncogenic DMTF1β promotes cancer cell motility by regulating autophagy through ULK1 stabilization
Molecular Oncology, EarlyView.In the current study, we demonstrate that the oncogene DMTF1β regulates ULK1 stability by reducing its proteasomal degradation in cancer cells. This stabilization enables ULK1 to induce autophagy, which in turn facilitates cancer cell migration. Consequently, reduced DMTF1β levels lead to decreased autophagy and impaired cancer cell migration.
Jun Xu +13 more
wiley +1 more source
, 2022 Computational graphs are a powerful formalism that have been extremely fruitful in deriving algorithms and software packages for neural networks and other models in machine learning. The basic idea in a computational graph is to express some model—for example a feedforward neural network—as a directed graph expressing a sequence of computational steps.
openaire +1 more source