Results 61 to 70 of about 154,143 (266)
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
Geo-spatial Information ScienceUnderstanding the multi-dimensional structure and evolution of geospatial phenomena is a fundamental challenge in Earth system science. Marine heatwaves (MHWs), as critical 4D spatio-temporal events in the ocean, exhibit complex vertical heterogeneity ...
Jianing Yu +4 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
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
Minimum 2-vertex strongly biconnected spanning directed subgraph problem [PDF]
Discrete Mathematics Letters, 2021 Raed Jaberi
doaj +1 more source
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
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
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs
IEEE Access, 2020 The notion of k-truss has been introduced a decade ago in social network analysis and security for community detection, as a form of cohesive subgraphs less stringent than a clique (set of pairwise linked nodes), and more selective than a k-core (induced
Alessio Conte +4 more
doaj +1 more source
Algorithms for gerrymandering over graphs
Theoretical Computer Science, 2019 We initiate the systematic algorithmic study for gerrymandering over graphs that was recently introduced by Cohen-Zemach, Lewenberg and Rosenschein. Namely, we study a strategic procedure for a political districting designer to draw electoral district boundaries so that a particular target candidate can win in an election.
Ito, Takehiro +3 more
openaire +3 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