Results 91 to 100 of about 36,227 (305)
Hyperosmotic stress triggers the relocation of the CFIm complex from the nucleus to the cytoplasm. This shift creates a nuclear ‘stoichiometric bottleneck’, limiting CFIm availability for mRNA processing. Consequently, specific mRNAs like NUDT21 and DICER1 undergo targeted 3′UTR shortening, demonstrating how spatial protein dynamics drive rapid ...
Hitomi Soumiya +2 more
wiley +1 more source
Distributed Graph Simulation: Impossibility and Possibility
This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin +3 more
core
Loss of AMBRA1 activates MAPK and angiogenesis signaling pathways in melanoma cells
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
ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang +10 more
wiley +1 more source
Experimental Validation of Graph Theory-Based Leak Detection Algorithm
In this paper, we present results from a study on leak detection based on graph partitioning. Leaks are isolated using graph partitioning and performing mass balances over the partitions.
Lisa Saboo +4 more
doaj +1 more source
VLSI PARTITIONING ALGORITHM WITH ADAPTIVE CONTROL PARAMETER [PDF]
The article deals with the problem of very large-scale integration circuit partitioning. A graph is selected as a mathematical model describing integrated circuit.
P. N. Filippenko
doaj
Multilevel Unbalanced Graph Partitioning with Applications to Graph Drawing
在資訊科學研究中,圖形切割問題廣泛出現在多種領域內,其中也包括圖形繪製。在圖形繪製中,一個好的呈現在於是否將各節點間的相互關係表現出來。而區分的方式便是利用圖形切割演算法。 在本篇論文中,我們提出一個與過去不同的切割方法,先在樹上做切割,再對應到圖形上,藉以區分不同群集,進行一連串調整的動作找出最佳解,而最後利用force-directed placement的方法將圖形繪製出來。 過去在找尋k-partition的方法,最典型的是將原圖切割成兩份,再將其中一份切成兩份,以此類推,最後再稍作調整 ...
林淑棻, Lin, Shu-Fen
core
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
Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs [PDF]
In this paper, we present an approach to search result clustering, using partitioning of underlying link graph. We define the notion of "query-induced subgraph" and formulate the problem of search result clustering as a problem of efficient partitioning ...
A. Bradic
doaj
A Dynamic-Programming Heuristic for Regular Grid-Graph Partitioning
Previous researchers have demonstrated that striping heuristics produce very good (and, in some cases, asymptotically optimal) partitions for regular grid graphs.
Donaldson, William, Meyer, Robert
core

