Results 41 to 50 of about 547,023 (266)
MathematicsThere are many different algorithms for calculating the distances between DNA chains. Different algorithms for determining such distances give different results.
Boris Melnikov
doaj +1 more source
Peroxidasin enables melanoma immune escape by inhibiting natural killer cell cytotoxicity
Molecular Oncology, EarlyView.Peroxidasin (PXDN) is secreted by melanoma cells and binds the NK cell receptor NKG2D, thereby suppressing NK cell activation and cytotoxicity. PXDN depletion restores NKG2D signaling and enables effective NK cell–mediated melanoma killing. These findings identify PXDN as a previously unrecognized immune evasion factor and a potential target to improve
Hsu‐Min Sung +17 more
wiley +1 more source
Современные информационные технологии и IT-образование, 2019 Bioinformatics has two important problems for the study of evolutionary processes: calculating the distance between DNA sequences and restoring a matrix of distances sequences of different genomes when not all initial elements are known. Due to the large
Mikhail E. Abramyan +2 more
doaj +1 more source
Research on decision method based on probability hesitation fuzzy comprehensive distance measure
Xibei Gongye Daxue Xuebao, 2023 Aiming at the defects of the existing probabilistic hesitation fuzzy distance measures, which require the number of membership degree to be consistent and the order to be rearranged, a probabilistic hesitation fuzzy multi-attribute decision making method
LIU Ying, GUAN Xin, WU Bin
doaj +1 more source
Tumor mutational burden as a determinant of metastatic dissemination patterns
Molecular Oncology, EarlyView.This study performed a comprehensive analysis of genomic data to elucidate whether metastasis in certain organs share genetic characteristics regardless of cancer type. No robust mutational patterns were identified across different metastatic locations and cancer types.
Eduardo Candeal +4 more
wiley +1 more source
On the Distance Spectral Radius of Trees with Given Degree Sequence
Discussiones Mathematicae Graph Theory, 2020 We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth +2 more
doaj +1 more source
Karpatsʹkì Matematičnì Publìkacìï, 2022 If $Tr(G)$ and $D(G)$ are respectively the diagonal matrix of vertex transmission degrees and distance matrix of a connected graph $G$, the generalized distance matrix $D_{\alpha}(G)$ is defined as $D_{\alpha}(G)=\alpha ~Tr(G)+(1-\alpha)~D(G)$, where $0 ...
M. Merajuddin, S. Bhatnagar, S. Pirzada
doaj +1 more source
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
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
Distance matrix polynomials of trees
Advances in Mathematics, 1978 AbstractLet G be a finite connected graph. If x and y are vertices of G, one may define a distance function dG on G by letting dG(x, y) be the minimal length of any path between x and y in G (with dG(x, x) = 0). Thus, for example, dG(x, y) = 1 if and only if {x, y} is an edge of G.
Graham, R.L, Lovász, L
openaire +2 more sources