Results 81 to 90 of about 2,196,757 (262)
Distributed Graph Simulation: Impossibility and Possibility [PDF]
, 2014 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
Finding the most relevant fragments in networks [PDF]
, 2010 We study a point pattern detection problem on networks, motivated by applications in geographical analysis, such as crime hotspot detection. Given a network N (a connected graph with non-negative edge lengths) together with a set of sites, which lie on ...
Rote, G. +9 more
core +2 more sources
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
FEBS Open Bio, EarlyView.PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank
FEBS Open Bio, EarlyView.Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer +7 more
wiley +1 more source
Diversified Top-k Graph Pattern Matching [PDF]
, 2013 Graph pattern matching has been widely used in e.g., social data analysis. A number of matching algorithms have been developed that, given a graph pattern Q and a graph G, compute the set M(Q;G) of matches of Q in G.
Wang, Xin +2 more
core
Distance-Preserving Graph Compression Techniques
Journal of Graph Algorithms and ApplicationsWe study the problem of distance-preserving graph compression for weighted paths and trees. The problem entails a weighted graph $G = (V, E)$ with non-negative weights and a subset of edges $E^{\prime} \subset E$, which needs to be removed from G (with
Amirali Madani, Anil Maheshwari
doaj +1 more source
RNA Sequencing Resolves Cryptic Pathogenic Variants in Mitochondrial Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Mitochondrial diseases are the most common inherited metabolic disorders, characterized by pronounced clinical and genetic heterogeneity that complicates molecular diagnosis. Although DNA‐based sequencing approaches have become standard in genetic testing, up to half of patients remain without a definitive diagnosis.
Zhimei Liu +21 more
wiley +1 more source
GRAph Parallel Actor Language — A Programming Language for Parallel
, 2013 All Rights Reservediii We introduce a domain-specific language, GRAph PArallel Actor Language, that enables parallel graph algorithms to be written in a natural, high-level form.
Graph Algorithms, Michael Delorimier
core
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective The prognosis of glioblastoma (GBM) remains highly unfavorable, largely due to high tumor heterogeneity and an immunosuppressive microenvironment. However, the functional role of PANoptosis in this context is poorly understood. Methods Patients were stratified via K‐means clustering. A risk score model was constructed using prognosis‐
Langfei Tian +6 more
wiley +1 more source