Results 61 to 70 of about 827,001 (270)
Malware Detection via Extended Label Propagation Through Graph Inference
IEEE Access, 2019 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
On the predictibility of A-minor motifs from their local contexts
RNA Biology, 2022 This study investigates the importance of the structural context in the formation of a type I/II A-minor motif. This very frequent structural motif has been shown to be important in the spatial folding of RNA molecules.
Coline Gianfrotta +4 more
doaj +1 more source
FEBS Open Bio, EarlyView.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
Derandomization of Online Assignment Algorithms for Dynamic Graphs [PDF]
, 2011 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
Graph Representations for Reinforcement Learning
Journal of Computer Science and TechnologyGraph analysis is becoming increasingly important due to the expressive power of graph models and the efficient algorithms available for processing them.
Esteban Schab +2 more
doaj +1 more source
Algorithms, 2019 We study two problems in computational phylogenetics. The first is tree compatibility. The input is a collection of phylogenetic trees over different partially-overlapping sets of species.
David Fernández-Baca, Lei Liu
doaj +1 more source
A Genetic Algorithm for the Maximum 2–Packing Set Problem
International Journal of Applied Mathematics and Computer Science, 2020 Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality.
Trejo-Sánchez Joel Antonio +2 more
doaj +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.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
Minimum 2-vertex strongly biconnected spanning directed subgraph problem [PDF]
Discrete Mathematics Letters, 2021 Raed Jaberi
doaj +1 more source
FEBS Open Bio, EarlyView.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