Results 31 to 40 of about 112,189 (262)
BMC BioinformaticsMotivation The prediction of cancer drug response is a challenging subject in modern personalized cancer therapy due to the uncertainty of drug efficacy and the heterogeneity of patients.
Chuanqi Lao +5 more
doaj +1 more source
K-Connected Cores Computation in Large Dual Networks
Data Science and Engineering, 2018 Computing $$k\text {-}core$$ k-core s is a fundamental and important graph problem, which can be applied in many areas, such as community detection, network visualization, and network topology analysis.
Lizhen Cui, Lingxi Yue, Dong Wen, Lu Qin
doaj +1 more source
FEBS 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
FEBS Letters, EarlyView.Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai +4 more
wiley +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Computing the largest bond of a graph
CoRR, 2019 A bond of a graph $G$ is an inclusion-wise minimal disconnecting set of $G$, i.e., bonds are cut-sets that determine cuts $[S,V\setminus S]$ of $G$ such that $G[S]$ and $G[V\setminus S]$ are both connected. Given $s,t\in V(G)$, an $st$-bond of $G$ is a bond whose removal disconnects $s$ and $t$.
Gabriel L. Duarte +4 more
openaire +6 more sources
Edge computing task scheduling method based on user’s social relations: a construction and solution for Smart City Library [PDF]
PeerJ Computer ScienceIn the realm of the development of a Smart City Library, the integration of robust edge computing is vital. The research suggests a novel task-scheduling model for edge computing, leveraging user’s social relationships.
Yun Teng, Zijia Liu
doaj +2 more sources
TEE-Graph: efficient privacy and ownership protection for cloud-based graph spectral analysis
Frontiers in Big Data, 2023 IntroductionBig graphs like social network user interactions and customer rating matrices require significant computing resources to maintain. Data owners are now using public cloud resources for storage and computing elasticity.
A. K. M. Mubashwir Alam, Keke Chen
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
, 2022 AbstractA computation graph is a basic theoretical tool that underlines modern deep learning libraries. It is also an important component in Owl. This chapter first gives a bird’s-eye view on the computation graph in Owl and its importance in computing. We then demonstrate how to use it in Owl with some examples.
Liang Wang, Jianxin Zhao
openaire +1 more source