Results 81 to 90 of about 2,911,408 (294)

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, Adrián López García de Lomana, Thejus B. Venkatesh, Kritika Kirty, Snaevar Sigurdsson, Linda Vidarsdottir, Ramile Dilshat, Erla Sveinbjornsdottir, Snaedis Ragnarsdottir, Daniel H Magnusson, Maria R. Bustos, Eirikur Steingrimsson, Thorkell Gudjonsson, Stefan Sigurdsson   +13 more
wiley   +1 more source

The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$ [PDF]

E-Journal of Analysis and Applied Mathematics
The existence of $srg(99,14,1,2)$ has been a question of interest for several decades to the moment. In this paper, we consider the structural properties in general for the family of strongly regular graphs with parameters $\lambda =1$ and $\mu =2$.
Reimbay Reimbayev
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

Two Classes of Linear Codes From Weil Sums

IEEE Access, 2020
In this article, we consider two classes of $p$ -ary linear codes. This article is a generalization of the recent construction methods given by Jian, Lin and Feng (2019).
Hong Lu, Shudi Yang
doaj   +1 more source

On Strongly Regular Graphs withμ= 1

European Journal of Combinatorics, 2001
The paper looks at strongly regular graphs in which each pair of non-adjacent vertices has exactly one common neighbour. Relationships between the parameters of such graphs are explored as are some of the associated particle linear spaces and distance-regular graphs.
J. Deutsch, P. H. Fisher
openaire   +2 more sources

Random strongly regular graphs?

, 2003
Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6).
Cameron, Peter J., Peter J. Cameron, Cameron, Peter J.; id_orcid   +2 more
core   +1 more source

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

Molecular 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, Joel Rodrigues Vitória, Manuel Saiselet, Ligia Craciun, Denis Larsimont, Anne Lefort, Frédérick Libert, Carine Maenhaut, Sabine Costagliola, Maxime Tarabichi, Mirian Romitti, Vincent Detours   +11 more
wiley   +1 more source

Generalized quadrangles and subconstituent algebra ¹

Cubo, 2010
The point graph of a generalized quadrangle GQ (s, t) is a strongly regular graph G = srg( ?, ?, ?, μ) whose parameters depend on s and t. By a detailed analysis of the adjacency matrix we compute the Terwilliger algebra of this kind of graphs (and ...
Fernando Levstein, Carolina Maldonado
doaj  

On the extreme complexity of certain nearly regular graphs

Theory and Applications of Graphs
The complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs are graphs of maximal complexity among all graphs of the same order and degree; their complements are ...
Gregory P Constantine, Gregory C Magda
doaj   +1 more source

Epigenetic silencing of the liver‐specific lncRNA LUNAR promotes liver cancer progression via NOTCH activation

Molecular Oncology, EarlyView.
LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang, Hyung Seok Kim, Geum Ok Baek, Moon Gyeong Yoon, Su In Lee, Jee‐Yeong Jeong, Ji Eun Han, Soon Sun Kim, Jae Youn Cheong, Jung Woo Eun   +9 more
wiley   +1 more source