Results 91 to 100 of about 3,369,792 (260)
Graph Homomorphism Revisited for Graph Matching [PDF]
, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Molecular Oncology, EarlyView.Isocitrate dehydrogenase 1 (IDH1) mutations are highly recurrent in multiple human cancer types, including cholangiocarcinoma and glioma. IDH1 R132C is the most common IDH1 mutation in cholangiocarcinoma and likely arises from APOBEC3A‐ or APOBEC3B‐mediated deamination.
Kelly E. Butler +3 more
wiley +1 more source
Towards a Maude tool for model checking temporal graph properties [PDF]
, 2011 We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source
Molecular Oncology, EarlyView.This study identifies ARHGAP5, in addition to the frequently mutated ARHGAP35, as significantly mutated in endometrial cancer. Mutations in both genes co‐occur and are associated with their correlated downregulation. Functional CRISPR studies show that both paralogs regulate similar pathways, including actin cytoskeleton organization.
Mathilde Pinault +12 more
wiley +1 more source
A note on the metric dimension of subdivided thorn graphs
Indonesian Journal of Combinatorics, 2019 For some ordered subset W = {w1, w2, ⋯, wt} of vertices in connected graph G, and for some vertex v in G, the metric representation of v with respect to W is defined as the t-vector r(v∣W) = {d(v, w1), d(v, w2), ⋯, d(v, wt)}.
Lyra Yulianti +2 more
doaj +1 more source
Spectral Characterization of the Hamming Graphs [PDF]
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Koolen, J.H., Bang, S., Dam, E.R. van
core
The Configuration Space of Two Particles Moving on a Graph [PDF]
, 2010 In this thesis we study the configuration space, F (Γ, 2), of two particles moving without collisions on a graph Γ with a view to calculating the Betti numbers of this space. We develop an intersection theory for cycles in graphs inspired by the classical
BARNETT, KATHRYN
core
Molecular Oncology, EarlyView.Incomplete microwave ablation (iMWA) of liver cancer triggers a biphasic progression in residual tumors. At Day 3, the microenvironment is characterized by acute inflammatory responses and extracellular matrix (ECM) remodeling. By Day 14, a profound shift occurs toward oncogenic signal transduction and immunosuppression, marked by macrophage ...
Yu Liu +9 more
wiley +1 more source
Partitioning graphs into complete and empty graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tínaz Ekim, John Gimbel
openaire +1 more source
Molecular Oncology, EarlyView.The kinase SRPK1 directly interacts with the protein TOPBP1 and regulates the pre‐mRNA splicing of WIZ thereby contributing to the activation of the ATR/CHK1 replicative checkpoint in response to replicative stress. This allows cancer cells' genomic stability and survival.
Amani Shreim +17 more
wiley +1 more source