Results 71 to 80 of about 34,352 (308)
INTERPOLATION OF GRAPH SIGNALS USING SHIFT-INVARIANT GRAPH FILTERS [PDF]
New schemes to recover signals defined in the nodes of a graph are proposed. Our focus is on reconstructing bandlimited graph signals, which are signals that admit a sparse rep-resentation in a frequency domain related to the structure of the graph.
Antonio G. Marques +3 more
core +1 more source
The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States [PDF]
This paper introduces the foliage partition, an easy-to-compute LC-invariant for graph states, of computational complexity O(n3) in the number of qubits. Inspired by the foliage of a graph, our invariant has a natural graphical representation in terms of
Burchardt, Adam, Hahn, Frederik
core +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
On a novel eccentricity-based invariant of a graph [PDF]
In this paper, for the purpose of measuring the non-self-centrality extent of non-selfcentered graphs, a novel eccentricity-based invariant, named as non-self-centrality number (NSC number for short), of a graph G is defined as follows: N(G)=?vivj?V(G ...
Das K.C., Maden A.D., Xu K.X.
core +3 more sources
Computing the Energy and Estrada Index of Different Molecular Structures
Graph energy is an invariant that is derived from the spectrum of the adjacency matrix of a graph. Graph energy is actually the absolute sum of all the eigenvalues of the adjacency matrix of a graph i.e.
Zeeshan Saleem Mufti +5 more
doaj +1 more source
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura +19 more
wiley +1 more source
ALGORITHMS OF COMPARATIVE ANALYSIS OF TWO INVARIANTS OF A GRAPH
Algorithms of definition of isomorphism of graphs have wide application in various areas, such as: problems of syntactic and structural recognition of images, problems of mathematical chemistry, research of social networks and the Internet, and also ...
Boris F. Melnikov, Nadezhda P. Churikova
doaj +1 more source
Some Invariants of Circulant Graphs [PDF]
Topological indices and polynomials are predicting properties like boiling points, fracture toughness, heat of formation, etc., of different materials, and thus save us from extra experimental burden. In this article we compute many topological indices for the family of circulant graphs.
Mobeen Munir +3 more
openaire +1 more source
Invariant Spectral Hashing of Image Saliency Graph [PDF]
Image hashing is the process of associating a short vector of bits to an image. The resulting summaries are useful in many applications including image indexing, image authentication and pattern recognition.
Taquet, Maxime +2 more
core
The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source

