To use all functions of this page, please activate cookies in your browser.
my.bionity.com
With an accout for my.bionity.com you can always see everything at a glance – and you can configure your own website and individual newsletter.
 My watch list
 My saved searches
 My saved topics
 My newsletter
Distance matrixIn mathematics, a distance matrix is a matrix (twodimensional array) containing the distances, taken pairwise, of a set of points. It is therefore a symmetric N×N matrix containing nonnegative reals as elements, given N points in Euclidean space. The number of pairs of points N×(N1)/2 is the number of independent elements in the distance matrix. Distance matrices are closely related to adjacency matrices, with the difference that the latter only provides the information which vertices are connected but does not tell about costs or distances between the vertices. Therefore a distance matrix can be thought of as a weighted form of an adjacency matrix. Additional recommended knowledgeFor example, suppose these data are to be analyzed. Where pixel euclidean distance is the distance metric.
The distance matrix would be:
These data can then be viewed in graphic form as a heat map. In this image, black denotes a distance of 0 and white is maximal distance.
In bioinformatics, distance matrices are used to represent protein structures in a coordinateindependent manner, as well as the pairwise distances between two sequences in sequence space. They are used in structural and sequential alignment, and for the determination of protein structures from NMR or Xray crystallography. Sometimes it is more convenient to express data as a similarity matrix. See also


This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Distance_matrix". A list of authors is available in Wikipedia. 