Results 61 to 70 of about 190,829 (309)

Partitioning a graph into highly connected subgraphs [PDF]

open access: yes, 2015
Given $k\ge 1$, a $k$-proper partition of a graph $G$ is a partition ${\mathcal P}$ of $V(G)$ such that each part $P$ of ${\mathcal P}$ induces a $k$-connected subgraph of $G$. We prove that if $G$ is a graph of order $n$ such that $\delta(G)\ge \sqrt{n}$
Borozan, Valentin   +6 more
core   +2 more sources

C9orf72 ALS‐causing mutations lead to mislocalization and aggregation of nucleoporin Nup107 into stress granules

open access: yesFEBS Letters, EarlyView.
Mutations in the C9orf72 gene represent the most common genetic cause of amyotrophic lateral sclerosis (ALS), a fatal neurodegenerative disease. Using patient‐derived neurons and C. elegans models, we find that the nucleoporin Nup107 is dysregulated in C9orf72‐associated ALS. Conversely, reducing Nup107 levels mitigates disease‐related changes.
Saygın Bilican   +7 more
wiley   +1 more source

Dual Clustering-Based Method for Geospatial Knowledge Graph Partitioning

open access: yesApplied Sciences
Geospatial knowledge graphs provide critical technology for integrating geographic information and semantic knowledge, which are very useful for geographic data analysis.
Yuxuan Chen   +7 more
doaj   +1 more source

TAPER: query-aware, partition-enhancement for large, heterogenous, graphs

open access: yes, 2016
Graph partitioning has long been seen as a viable approach to address Graph DBMS scalability. A partitioning, however, may introduce extra query processing latency unless it is sensitive to a specific query workload, and optimised to minimise inter ...
Firth, Hugo, Missier, Paolo
core   +1 more source

Graph partitioning by Eigenvectors

open access: yesLinear Algebra and its Applications, 1988
Given a graph G on n vertices and \(z\in R^ n\), we say that a vertex of G is positive, nonnegative, null, etc. if the corresponding entry of z has that property. For z such that Az\(\geq \alpha z\) (A is the adjacency matrix of G) the number of components of the subgraph induced by positive vertices is bounded.
openaire   +3 more sources

From lactation to malignancy: A comparison between healthy and cancerous breast gland at single‐cell resolution reveals new issues for tumorigenesis

open access: yesFEBS Letters, EarlyView.
Single‐cell RNA sequencing reveals an opposite role of SLPI in basal tumors based on metastatic spread, along with shared activation of specific regulons in cancer cells and mature luminal lactocytes, as well as downregulation of MALAT1 and NEAT1 in the latter.
Pietro Ancona   +4 more
wiley   +1 more source

Scalable partitioning for parallel position based dynamics [PDF]

open access: yes, 2015
We introduce a practical partitioning technique designed for parallelizing Position Based Dynamics, and exploiting the ubiquitous multi-core processors present in current commodity GPUs.
Fratarcangeli, M., Pellacini, Fabio
core   +2 more sources

Enteropathogenic E. coli shows delayed attachment and host response in human jejunum organoid‐derived monolayers compared to HeLa cells

open access: yesFEBS Letters, EarlyView.
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi   +5 more
wiley   +1 more source

An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph

open access: yesData Science and Engineering, 2019
The coarse-grained multicomputer parallel model (CGM for short) has been used for solving several classes of dynamic programming problems. In this paper, we propose a parallel algorithm on the CGM model, with p processors, for solving the optimal binary ...
Vianney Kengne Tchendji   +1 more
doaj   +1 more source

Partitioning a call graph [PDF]

open access: yes, 2005
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system ...
Bisseling, Rob H.   +8 more
core   +1 more source

Home - About - Disclaimer - Privacy