Results 61 to 70 of about 337,199 (252)
Matroids of Gain Signed Graphs
Discrete & Computational Geometry, 2023 13 fig., 46 pp. v2 has new Example 3.7, minor editing, 47 pp.
Laura Anderson +2 more
openaire +2 more sources
Spectrum-based deep neural networks for fraud detection
, 2017 In this paper, we focus on fraud detection on a signed graph with only a small set of labeled training data. We propose a novel framework that combines deep neural networks and spectral graph analysis. In particular, we use the node projection (called as
Li, Jun +3 more
core +1 more source
Aggressive prostate cancer is associated with pericyte dysfunction
Molecular Oncology, EarlyView.Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero +11 more
wiley +1 more source
List homomorphism problems for signed graphs
, 2021 We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in V(G)$, of ...
Bok, Jan +4 more
core
Survivin and Aurora Kinase A control cell fate decisions during mitosis
Molecular Oncology, EarlyView.Aurora A interacts with survivin during mitosis and regulates its centromeric role. Loss of Aurora A activity mislocalises survivin, the CPC and BubR1, leading to disruption of the spindle checkpoint and triggering premature mitotic exit, which we refer to as ‘mitotic slippage’.
Hana Abdelkabir +2 more
wiley +1 more source
On colorings and orientations of signed graphs [PDF]
Discrete Mathematics Letters, 2023 Daniel Slilaty
doaj +1 more source
The common minimal common neighborhood dominating signed graphs [PDF]
Transactions on Combinatorics, 2013 In this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $CN$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $CN$-dominating signed graphs.In the ...
Kavita S Permi +2 more
doaj
Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA
Molecular Oncology, EarlyView.Cell‐free DNA (cfDNA) fragments in plasma from cancer patients carry epigenetic signatures reflecting their cells of origin. These epigenetic features include DNA methylation, nucleosome modifications, and variations in fragmentation. This review describes the biological properties of each feature and explores optimal strategies for harnessing cfDNA ...
Christoffer Trier Maansson +2 more
wiley +1 more source
Molecular Oncology, EarlyView.HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto +13 more
wiley +1 more source
On signed degrees in signed graphs [PDF]
Czechoslovak Mathematical Journal, 1994 A graph is called signed if there is a designation of its edges as either positive or negative. The signed degree of a vertex \(v\) is the number of positive edges through \(v\) less the number of negative edges through \(v\). The degree sequence consists of signed degrees of all vertices in nonincreasing order.
Chartrand, Gary +3 more
openaire +2 more sources