Results 71 to 80 of about 118,378,802 (306)
BinSlayer: Accurate Comparison of Binary Executables [PDF]
As the volume of malware inexorably rises, comparison of binary code is of increasing importance to security analysts as a method of automatically classifying new malware samples; purportedly new examples of malware are frequently a simple evolution of ...
Martial Bourquin +5 more
core +1 more source
Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
On a relation between Szeged and Wiener indices of bipartite graphs [PDF]
Hansen et. al., using the AutoGraphiX software package, conjectured that the Szeged index Sz(G) and the Wiener index W(G) of a connected bipartite graph G with n ≥ 4 vertices and m ≥ n edges, obeys the relation Sz(G) − W(G) ≥ 4n − 8. Moreover, this bound
Ivan Gutman +3 more
doaj
Distance-Regular Graphs and Halved Graphs
Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire +3 more sources
LVRF (lymphatic and vascular resistance factor) is a VEGFA splice variant upregulated in response to anti‐angiogenic therapy that fosters tumor adaptation through enhanced vascularization, lymphangiogenesis, and metastatic dissemination. Targeting LVRF with fully human neutralizing antibodies disrupts these processes and limits resistant tumor growth ...
Marion David +12 more
wiley +1 more source
A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs [PDF]
Graph coloring is a crucial area of research in graph theory, with numerous algorithms proposed for various types of graph coloring, particularly graph p-distance coloring.
Hanifa Mosawi +2 more
doaj +1 more source
Fractional Local Metric Dimension of Comb Product Graphs
The local resolving neighborhood of a pair of vertices for and is if there is a vertex in a connected graph where the distance from to is not equal to the distance from to , or defined by .
Siti Aisyah +2 more
doaj +1 more source
On the editing distance of graphs [PDF]
AbstractAn edge‐operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from G to $\cal G$ is the smallest number of edge‐operations needed to modify G into a graph from $\cal G$.
Maria Axenovich +2 more
openaire +3 more sources
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
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

