Results 51 to 60 of about 4,837,596 (345)
Mathematics, 2021 Let G be a graph of order n. If the maximal connected subgraph of G has no cut vertex then it is called a block. If each block of graph G is a clique then G is called clique tree.
Shaowei Sun +2 more
doaj +1 more source
Mechanisms of parasite‐mediated disruption of brain vessels
FEBS Letters, EarlyView.Parasites can affect the blood vessels of the brain, often causing serious neurological problems. This review explains how different parasites interact with and disrupt these vessels, what this means for brain health, and why these processes matter. Understanding these mechanisms may help us develop better ways to prevent or treat brain infections in ...
Leonor Loira +3 more
wiley +1 more source
A cospectral construction for the generalized distance matrix
Special MatricesThe generalized distance matrix of a graph is a matrix in which the (i,j)\left(i,j)th entry is a function, ff, of the distance between vertex ii and vertex jj.
Friesen Ori +5 more
doaj +1 more source
Support Values for Genome Phylogenies
Life, 2016 We have recently developed a distance metric for efficiently estimating the number of substitutions per site between unaligned genome sequences. These substitution rates are called “anchor distances” and can be used for phylogeny reconstruction.
Fabian Klötzl, Bernhard Haubold
doaj +1 more source
Data, 2023 The presented notes focus partially on two of the basic elements (accessibility and image) of any managed tourism destination from the perspective of basic ETL processes over open and third-party data.
Csaba Sidor +2 more
doaj +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Preserving privacy of spatial distances using randomized geometric surface calculations
Journal of Spatial Information ScienceThis paper introduces and evaluates a novel method for privacy-preserving distance computations. The method is based on randomized geometric surface calculations and replaces coordinates with contextual variables representing information about the ...
Jonas Klingwort, Sarah Redlich
doaj +1 more source
On Matrix Nearness Problems: Distance to Delocalization [PDF]
SIAM Journal on Matrix Analysis and Applications, 2015 Summary: In this paper we introduce a new matrix nearness problem that is intended to generalize the distance to instability. Due to its applicability in analyzing the robustness of eigenvalues with respect to the arbitrary localization sets (domains) in the complex plane, we call it the distance to delocalization.
Vladimir R. Kostić +2 more
openaire +3 more sources
Molecular Oncology, EarlyView.A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source
Classified AGV Material Flow and Layout Data Set for Multidisciplinary Investigation
IEEE Access, 2023 Automated Guided Vehicles (AGV) are increasingly used in industry to automate material flow tasks. To efficiently operate systems of AGVs, researchers have proposed many different planning and control methods, e.g., for scheduling, dispatching, and ...
Marvin Sperling +4 more
doaj +1 more source