Results 51 to 60 of about 832,460 (272)
A tri‐culture of iPSC‐derived neurons, astrocytes, and microglia treated with ferroptosis inducers as an Induced ferroptosis model was characterized by scRNA‐seq, cell survival, and cytokine release assays. This analysis revealed diverse microglial transcriptomic changes, indicating that the system captures key aspects of the complex cellular ...
Hongmei Lisa Li +6 more
wiley +1 more source
Temporal Graph Traversals: Definitions, Algorithms, and Applications [PDF]
A temporal graph is a graph in which connections between vertices are active at specific times, and such temporal information leads to completely new patterns and knowledge that are not present in a non-temporal graph.
Cheng, James, Huang, Silu, Wu, Huanhuan
core
In the communication systems domain, constructing and maintaining network topologies via topology control (TC) algorithms is an important cross-cutting research area.
Hollick, Matthias +5 more
core +1 more source
Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li +8 more
wiley +1 more source
Learning Graph Embedding with Adversarial Training Methods
Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure or minimizing the reconstruction ...
Fung, Sai-fu +5 more
core +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
Derandomization of Online Assignment Algorithms for Dynamic Graphs [PDF]
This paper analyzes different online algorithms for the problem of assigning weights to edges in a fully-connected bipartite graph that minimizes the overall cost while satisfying constraints.
Sahai, Ankur
core
Covering problems in edge- and node-weighted graphs
This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large integrality gap of a
A. Berger +18 more
core +1 more source
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Malware Detection via Extended Label Propagation Through Graph Inference
In this paper, we model the malware detection problem as a graph inference problem, and develop a novel belief propagation approach within a semi-supervised learning scheme that fully makes use of files' and hosts' connections to detect malware ...
Yitu Fu, Ju Xu
doaj +1 more source

