Results 111 to 120 of about 1,814,953 (245)

Dichotomy Theorems for Homomorphism Polynomials of Graph Classes

open access: yesJournal of Graph Algorithms and Applications, 2016
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph H and want to find all graphs, from some graph class, homomorphic
Christian Engels
doaj   +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

HcRPC: Highly Compact Reachability Preserving Graph Compression With Corrections

open access: yesIEEE Access, 2019
Graphs are used in numerous applications to model real-world systems and phenomena. The ever increasing size of graphs makes them difficult to query and analyze.
Rui Bing   +4 more
doaj   +1 more source

Translating whole‐genome doubling into precision medicine in cancer

open access: yesMolecular Oncology, EarlyView.
Whole‐genome doubling creates a WGD‐positive tumor state characterized by persistent chromosomal instability, karyotypic diversification, and cellular stress. These same biological pressures drive aggressive tumor evolution while exposing therapeutic vulnerabilities, providing a rationale for WGD‐informed precision medicine. Whole‐genome doubling (WGD)
Sejung Lee, Junghyeok Lim, Jinhyuk Bhin
wiley   +1 more source

PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS

open access: yesBarekeng
Graph labeling is the assigning of labels represented by integers or symbols to graph elements, edges and/or vertices (or both) of a graph. Consider a simple graph  with a vertex-set  and an edge-set .
Desi Rahmadani   +4 more
doaj   +1 more source

A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs

open access: yesJournal of Graph Algorithms and Applications, 2006
Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published.
Grant Cheston, Tjoen Seng Jap
doaj   +1 more source

ON A CLASS OF GOLDEN GRAPHS

open access: yesAdvances and Applications in Discrete Mathematics, 2021
Swamy, Narayan   +3 more
openaire   +1 more source

Single‐cell DNA methylation profiling: Technologies, computation, and applications in precision oncology

open access: yesMolecular Oncology, EarlyView.
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley   +1 more source

CEACAM1 participation in breast cancer progression

open access: yesMolecular Oncology, EarlyView.
In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin   +3 more
wiley   +1 more source

Constructing a Class of Symmetric Graphs

open access: yesEuropean Journal of Combinatorics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Home - About - Disclaimer - Privacy