Results 131 to 140 of about 178,314 (358)
Efficient model selection in switching linear dynamic systems by graph clustering [PDF]
, 2020 Parisa Karimi +3 more
openalex +1 more source
Loss of AMBRA1 activates MAPK and angiogenesis signaling pathways in melanoma cells
FEBS Open Bio, EarlyView.Loss of AMBRA1 in melanoma cells activates multiple oncogenic pathways associated with tumor progression. Transcriptomic and protein network analyses revealed that AMBRA1 depletion enhances MAPK/ERK signaling, angiogenesis, TGF‐β/EMT signaling, and Wnt/axon guidance pathways.
Milad Ibrahim +4 more
wiley +1 more source
Polyhedral Computations for the Simple Graph Partitioning Problem [PDF]
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal.
Sørensen, Michael M.
core
ADPSCAN: Structural Graph Clustering with Adaptive Density Peak Selection and Noise Re-Clustering
Applied SciencesStructural graph clustering is a data analysis technique that groups nodes within a graph based on their connectivity and structural similarity. The Structural graph clustering SCAN algorithm, a density-based clustering method, effectively identifies ...
Xinyu Du, Fangfang Li, Xiaohua Li, Ge Yu
doaj +1 more source
The effect of constraints on information loss and risk for clustering\n and modification based graph anonymization methods [PDF]
, 2014 David Nettleton +2 more
openalex +1 more source
FEBS Open Bio, EarlyView.The cytoskeleton‐mediated transport of mitochondria via tunnelling nanotubes restores respiration, increases ATP production, rescues cells from apoptosis, activates the AKT/mTOR signalling pathway, promotes cell migration and invasiveness, contributes to cancer progression and treatment resistance.
Stanislava Martínková, Jan Trnka
wiley +1 more source
The clustering coefficient of a scale-free random graph
, 2009 We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant.
Eggemann, N, Noble, S D
core
Spectral Geometry for Structural Pattern Recognition [PDF]
, 2010 Graphs are used pervasively in computer science as representations of data with a network or relational structure, where the graph structure provides a flexible representation such that there is no fixed dimensionality for objects. However, the analysis
El Ghawalby, Heyayda +1 more
core
The Clustergram: A Graph for Visualizing Hierarchical and Nonhierarchical Cluster Analyses [PDF]
, 2002 Matthias Schonlau
openalex +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano +11 more
wiley +1 more source