Results 51 to 60 of about 596,753 (209)

Distance matrix.

open access: yes, 2013
Distance matrix.
Brian S. Baldwin (335656)   +6 more
core   +1 more source

The Inconsistency of the Algorithms of Jaro–Winkler and Needleman–Wunsch Applied to DNA Chain Similarity Results

open access: yesMathematics
There 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

Research on decision method based on probability hesitation fuzzy comprehensive distance measure

open access: yesXibei 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

A constructive algorithm for realizing a distance matrix [PDF]

open access: yesEuropean Journal of Operational Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Varone Sacha C., Varone Sacha C.
openaire   +1 more source

Matrix factorisation and the interpretation of geodesic distance

open access: yesCoRR, 2021
Given a graph or similarity matrix, we consider the problem of recovering a notion of true distance between the nodes, and so their true positions. We show that this can be accomplished in two steps: matrix factorisation, followed by nonlinear dimension reduction.
Nick Whiteley   +2 more
openaire   +4 more sources

IMPLEMENTATION OF THE BRANCH AND BOUND METHOD FOR THE PROBLEM OF RECOVERING A DISTANCES MATRIX BETWEEN DNA STRINGS

open access: yesСовременные информационные технологии и 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

On spectral radius and Nordhaus-Gaddum type inequalities of the generalized distance matrix of graphs

open access: yesKarpatsʹ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

Information Mandala : Statistical Distance Matrix with Clustering [PDF]

open access: yes, 2021
In machine learning, observation features are measured in a metric space to obtain their distance function for optimization. Given similar features that are statistically sufficient as a population, a statistical distance between two probability ...
LU, XIN
core   +1 more source

A cospectral construction for the generalized distance matrix

open access: yesSpecial Matrices
The 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

On the Distance Spectral Radius of Trees with Given Degree Sequence

open access: yesDiscussiones 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

Home - About - Disclaimer - Privacy