Results 101 to 110 of about 1,437,233 (261)

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

Total Minimal Dominating Signed Graph [PDF]

open access: yes, 2010
Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core   +1 more source

Adversarial Directed Graph Embedding

open access: yes, 2021
Node representation learning for directed graphs is critically important to facilitate many graph mining tasks. To capture the directed edges between nodes, existing methods mostly learn two embedding vectors for each node, source vector and target ...
Li, Jianxin   +4 more
core   +1 more source

Inhibition of cyclin‐dependent kinases 12/13 using CT7439 as a treatment for colorectal cancer with CDK12 upregulation

open access: yesMolecular Oncology, EarlyView.
The proposed mechanism of action for the CDK12/13 inhibitor and cyclin K degrader, CT7439. CDK12/13 inhibition interrupts transcription elongation, leading to increased DNA damage that results in cell death. This agent is a potentially novel treatment option for patients with colorectal cancer. Created in BioRender. Cyclin‐dependent kinase (CDK) 12 and
Wylie K. Watlington   +10 more
wiley   +1 more source

Determinantal properties of Boolean graphs using recursive approach

open access: yesAKCE International Journal of Graphs and Combinatorics
The aim of this paper is to study the determinant and inverse of the adjacency matrices of weighted and directed versions of Boolean graphs. Our approach is recursive. We describe the adjacency matrix of a weighted Boolean graph in terms of the adjacency
Gahininath Sonawane   +2 more
doaj   +1 more source

Directed Graph for pRF Estimate Similarity.

open access: yes, 2014
The graph depicts binary edges leading from row to column as well as the sum total of incoming edges for each vertex (stimulus - mean luminance combination).Directed Graph for pRF Estimate Similarity.
Sven Gijsen (668482)   +3 more
core   +1 more source

Node-attribute graph layout for small-world networks [PDF]

open access: yes, 2011
Small-world networks are a very commonly occurring type of graph in the real-world, which exhibit a clustered structure that is not well represented by current graph layout algorithms. In many cases we also have information about the nodes in such graphs,
Joe Faith   +3 more
core   +1 more source

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

open access: yesMolecular 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   +9 more
wiley   +1 more source

Physics-Informed Directed Graph Network-Based Temperature Forecasting Model

open access: yesSensors
Recently, there has been a dramatic rise in the demand for accurate temperature forecasts. However, challenges arise from modeling and fusing complex spatial and temporal features in temperature data. In this study, we propose a physics-informed directed-
Jinjing Cai   +3 more
doaj   +1 more source

Algorithms for finding the minimum cycle mean in the weighted directed graph [PDF]

open access: yesComputer Science Journal of Moldova, 1998
In this paper we study the problem of finding the minimum cycle mean in the weighted directed graph. The computational aspect of some algorithms for solving this problem is discussed and two algorithms for minimum cycle mean finding in the weighted ...
D. Lozovanu, C. Petic
doaj  

Home - About - Disclaimer - Privacy