Results 51 to 60 of about 768,033 (273)
PLoS ONE, 2021 In this paper, we present a new method for detecting overlapping communities in networks with a predefined number of clusters called LPAM (Link Partitioning Around Medoids).
Alexander Ponomarenko +2 more
doaj +1 more source
Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential
FEBS Letters, EarlyView.Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta +3 more
wiley +1 more source
Minmax Tree Cover in the Euclidean Space
Journal of Graph Algorithms and Applications, 2011 Let G=(V,E) be an edge-weighted graph, and let w(H) denote the sum of the weights of the edges in a subgraph H of G. Given a positive integer k, the balanced tree partitioning problem requires to cover all vertices in V by a set T of k trees of the graph
Seigo Karakawa +2 more
doaj +1 more source
Partitioning Graph Clustering With User-Specified Density
IEEE Access, 2023 Graph clustering has attracted many interests in recent years, with numerous applications ranging from the clustering of computer networks to the detection of social communities.
Rohi Tariq +3 more
doaj +1 more source
Generalized partitions of graphs
Discrete Applied Mathematics, 1999 The authors introduce a general graph partitioning problem: Let \(C\) be a class of graphs and \(H\) a fixed graph with vertex class \(V(H)=\{1,2,\dots,n\}\). An (resp. ONTO) \((H,C)\)-partition of a graph \(G\) is a partition \(V_1,V_2,\dots,V_n\) of \(V(G)\) such that, for each \(i\), the subgraph of \(G\) induced by \(V_i\) belongs to \(C\) and, if \
Gary MacGilivray, Min-Li Yu
openaire +1 more source
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
FEBS Letters, EarlyView.Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley +1 more source
BiN-EdgePruning: edge pruning based on biased neighborhoods for printed circuit netlists [PDF]
PeerJ Computer ScienceAutomatic schematic generation is a key aspect of reverse engineering for printed circuit boards, and its cost is usually proportional to the size of the circuit.
Jie Yang +6 more
doaj +2 more sources
Emerging experimental and computational methods for studying redox‐regulated structural transitions
FEBS Letters, EarlyView.Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
GraSP: distributed streaming graph partitioning [PDF]
, 2015 This paper presents a distributed, streaming graph parti- tioner, Graph Streaming Partitioner (GraSP), which makes partition decisions as each vertex is read from memory, sim- ulating an online algorithm that must process nodes as they arrive.
Pienta, Pienta +5 more
core +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source