Results 81 to 90 of about 251,114 (266)

Characterization Of Super-Radial Graphs

Discussiones Mathematicae Graph Theory, 2014
In a graph G, the distance d(u, v) between a pair of vertices u and v is the length of a shortest path joining them. The eccentricity e(u) of a vertex u is the distance to a vertex farthest from u.
Kathiresan K.M., Marimuthu G., Parameswaran C.   +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, Mohammad Nour Alsamsam, Ugnė Bagdonaitė, Van Truc Vu, Chun‐Jen Huang, Polina Kuzhir, Mindaugas Zaremba, Aurimas Kopūstas, Marijonas Tutkus   +8 more
wiley   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

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, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

Distance independence in graphs

Discussiones Mathematicae Graph Theory, 2011
For a set D of positive integers, we define a vertex set SV (G) to be D-independent if u,v 2 S implies the distance d(u,v) 㘲 D. The D-independence numberD(G) is the maximum cardinality of a D-independent set. In particular, the independence number (G) = {1}(G).
J. Louis Sewell, Peter J. Slater
openaire   +1 more source

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

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, Yuhei Hosokawa, Lars Oliver Essen, Manuel Maestre‐Reyna   +3 more
wiley   +1 more source

Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]

EPJ Web of Conferences
Mapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika, Patel Priyanka, Katare Rakesh Kumar, Katare Charvi   +3 more
doaj   +1 more source

Mean distance in a graph

Discrete Mathematics, 1977
AbstractThe average or mean of the distances between vertices in a connected graph Γ, μ(Γ), is a natural measure of the compactness of the graph. In this paper we compute bounds for μ(Γ) in terms of the number of vertices in Γ and the diameter of Γ. We prove a formula for computing μ(Γ) when Γ is a tree which is particularly useful when Γ has a high ...
J. K. Doyle, Jack E. Graver
openaire   +2 more sources

From energy provision to protein synthesis: Tunnelling nanotubes as mediators of intercellular metabolic cooperation in cancer

FEBS Open Bio, EarlyView.
The cytoskeleton‐mediated transport of mitochondria via tunnelling nanotubes restores respiration, increases ATP production, rescues cells from apoptosis, activates the AKT/mTOR signalling pathway, promotes cell migration and invasiveness, contributes to cancer progression and treatment resistance.
Stanislava Martínková, Jan Trnka
wiley   +1 more source

On distance-regularity in graphs

Journal of Combinatorial Theory, Series B, 1982
AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on the same vertex set in which a pair of vertices is adjacent if and only if their distance apart is i in G. If G is distance-regular, then Ai is a polynomial of degree i in A. It is shown that the converse is also true.
openaire   +1 more source

MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis

FEBS Open Bio, EarlyView.
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss, Ao Li, Eduardo H. Gilglioni, Mayank Bansal, Sumeet Pal Singh, Latifa Bakiri, Alessandra K. Cardozo, Esteban N. Gurzov   +7 more
wiley   +1 more source