Distance matrix

In mathematics, computer science and especially graph theory, a distance matrix is a matrix (two-dimensional array) containing the distances, taken… (More)
Wikipedia

Related topics

Related topics

40 relations
Adjacency matrixAlexandru BalabanAlignment-free sequence analysisBioinformatics
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Multiscale Distance Matrix for Fast Plant Leaf Recognition
In this brief, we propose a novel contour-based shape descriptor, called the multiscale distance matrix, to capture the shape… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Low-rank optimization for distance matrix completion
This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
Novel graph distance matrix
We have introduced novel distance matrix for graphs, which is based on interpretation of columns of the adjacency matrix of a… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Sensor network localization, euclidean distance matrix completions, and graph realization
We study Semidefinite Programming, SDP, relaxations for Sensor Network Localization, SNL, with anchors and with noisy distance… (More)
Is this relevant?
2005
2005
INVERSE KINEMATICS BY DISTANCE MATRIX COMPLETION
INTRODUCTION The Theory of Distance Geometry [1] allows coordinate-free formulations for most position analysis problems. Using… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A new sequence distance measure for phylogenetic tree construction
MOTIVATION Most existing approaches for phylogenetic inference use multiple alignment of sequences and assume some sort of an… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2000
2000
Distance Matrix Completion by Numerical Optimization
Consider the problem of determining whether or not a partial dissimilarity matrix can be completed to a Euclidean distance matrix… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
Given a partial symmetric matrixA with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Properties of Euclidean and Non-Euclidean Distance Matrices
A distance matrix D of order n is symmetric with elements idfj, where d,, = 0. D is Euclidean when the in(n 1) quantities dij can… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Distance Matrix Polynomials of Trees
Let G be a finite connected graph. If x and y are vertices of G, one may define a distance function d, on G by letting d&x, y) be… (More)
  • figure 5
  • figure 6
  • figure 8
  • figure 9
  • figure 18
Is this relevant?