Results 81 to 90 of about 46,480 (299)

Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining

Molecular Oncology, EarlyView.
IGF‐1R promotes radioresistance by facilitating DNA‐PKcs recruitment to chromatin, enabling non‐homologous end‐joining (NHEJ) repair of double‐strand breaks. Inhibition or loss of IGF‐1R disrupts this recruitment to damage sites, driving compensatory reliance on microhomology‐mediated end‐joining (MMEJ) repair.
Matthew O. Ellis, Jack V. Mills, Wojciech Niedzwiedz, Valentine M. Macaulay   +3 more
wiley   +1 more source

Efficient Algorithms for Factorization and Join of Blades [PDF]

, 2010
Subspaces are powerful tools for modeling geometry. In geometric algebra, they are represented using blades and constructed using the outer product.
Fontijne, D., Dorst, L., Daniel Fontijne, Leo Dorst   +3 more
core   +1 more source

Operations on Intuitionistic Fuzzy Graph Structures

Fuzzy Information and Engineering, 2016
An intuitionistic fuzzy graph structure (IFGS) is a generalization of an intuitionistic fuzzy graph. The concept of intuitionistic fuzzy graph structure is introduced and investigated in this paper.
Muhammad Akram, Rabia Akmal
doaj   +1 more source

The G-Convexity and the G-Centroids of Composite Graphs

Mathematics, 2020
The graph centroids defined through a topological property of a graph called g-convexity found its application in various fields. They have classified under the “facility location” problem.
Prakash Veeraraghavan
doaj   +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, Nicolas J. Niklaus, Anna M. Schläfli, Igor Tokarchuk, Magali Humbert, Federico La Manna, Bich Vu, David Maul, Ramin Radpour, Marianna Kruithof‐de Julio, Inti Zlobec, Jörn Dengjel, Bruce E. Torbett, Mario P. Tschan   +13 more
wiley   +1 more source

On the set chromatic number of the join and comb product of graphs

, 2020
A vertex coloring c : V(G) → of a non-trivial connected graph G is called a set coloring if NC(u) ≠ NC(v) for any pair of adjacent vertices u and v. Here, NC(x) denotes the set of colors assigned to vertices adjacent to x. The set chromatic number of G,
Garciano, Agnes, Felipe, Bryan Ceasar L, Tolentino, Mark Anthony C   +2 more
core  

Distributed streaming set similarity join

, 2020
© 2020 IEEE. With the prevalence of Internet access and user generated content, a large number of documents/records, such as news and web pages, have been continuously generated in an unprecedented manner. In this paper, we study the problem of efficient
Wang, X, Zhang, W, Xiang Wang, Xuemin Lin, Ying Zhang, Lin, X, Yang, J, Jianye Yang, Zhang, Y, Wenjie Zhang   +9 more
core   +1 more source

Patient therapy outcome modeling in cancer organoids is improved by cancer‐associated fibroblasts and organoid assembly convolution

Molecular Oncology, EarlyView.
Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski, Liudmyla Dolinchuk, Michał Jerzak, Albert Gandurski, Tomasz Grochowski, Weronika Wojtyś, Maciej Zadrożny, Wojciech Kaźmierczak, Małgorzata Lenarcik, Marta Matejak‐Górska, Radosław Samsel, Tomasz Olesiński, Dawid Walerych   +12 more
wiley   +1 more source

The condition number of join decompositions

, 2018
The join set of a finite collection of smooth embedded submanifolds of a mutual vector space is defined as their Minkowski sum. Join decompositions generalize some ubiquitous decompositions in multilinear algebra, namely tensor rank, Waring, partially ...
Breiding, Paul, Nick Vannieuwenhoven, Vannieuwenhoven, Nick, Breiding, P., Vannieuwenhoven, N., Paul Breiding   +5 more
core   +1 more source

On Near Mean Graphs [PDF]

, 2010
A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. The graph that admits a near mean labeling is called a near mean graph (NMG)
Nagarajan, A., Nellai Murugan, A., Navaneetha Krishnan, S.   +2 more
core   +1 more source