Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,258,702 papers from all fields of science
Search
Sign In
Create Free Account
Distance matrix
In mathematics, computer science and especially graph theory, a distance matrix is a matrix (two-dimensional array) containing the distances, taken…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
41 relations
Adjacency matrix
Alexandru Balaban
Alignment-free sequence analysis
Bioinformatics
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Predicting Station-level Hourly Demands in a Large-scale Bike-sharing Network: A Graph Convolutional Neural Network Approach
Lei Lin
,
Zhengbing He
,
S. Peeta
,
Xuejin Wen
Transportation Research Part C: Emerging…
2017
Corpus ID: 30933402
Highly Cited
2013
Highly Cited
2013
Discriminative Segment Annotation in Weakly Labeled Video
K. Tang
,
R. Sukthankar
,
J. Yagnik
,
Li Fei-Fei
IEEE Conference on Computer Vision and Pattern…
2013
Corpus ID: 12977880
The ubiquitous availability of Internet video offers the vision community the exciting opportunity to directly learn localized…
Expand
Highly Cited
2010
Highly Cited
2010
On Distance Energy of Graphs
G. Indulal
,
Ivan Gutmanb
2010
Corpus ID: 9351128
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute…
Expand
Highly Cited
2008
Highly Cited
2008
Rapid Neighbour-Joining
Martin Simonsen
,
T. Mailund
,
Christian N. S. Pedersen
Workshop on Algorithms in Bioinformatics
2008
Corpus ID: 369196
The neighbour-joining method reconstructs phylogenies by iteratively joining pairs of nodes until a single node remains. The…
Expand
Highly Cited
2007
Highly Cited
2007
Engineering signal processing based on adaptive step-changed stochastic resonance
L. Qiang
,
Tai-yong Wang
,
Y. Leng
,
Wang Wei
,
Guo-feng Wang
2007
Corpus ID: 5016053
Highly Cited
2006
Highly Cited
2006
KNN-kernel density-based clustering for high-dimensional multivariate data
T. Tran
,
R. Wehrens
,
L. Buydens
Computational Statistics & Data Analysis
2006
Corpus ID: 18162625
Highly Cited
2005
Highly Cited
2005
FastMap, MetricMap, and Landmark MDS are all Nystrom Algorithms
J. Platt
International Conference on Artificial…
2005
Corpus ID: 6558500
This paper unifies the mathematical foundation of three multidimen- sional scaling algorithms: FastMap, MetricMap, and Landmark…
Expand
Highly Cited
2005
Highly Cited
2005
Spectral Clustering of Biological Sequence Data
William Pentney
,
M. Meilă
AAAI Conference on Artificial Intelligence
2005
Corpus ID: 6479458
In this paper, we apply spectral techniques to clustering biological sequence data that has proved more difficult to cluster…
Expand
Highly Cited
1999
Highly Cited
1999
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
A. Alfakih
,
A. Khandani
,
Henry Wolkowicz
Computational optimization and applications
1999
Corpus ID: 6130341
Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP…
Expand
Highly Cited
1999
Highly Cited
1999
Canonical correspondence analysis for estimating spatial and environmental effects on microsatellite gene diversity in brook charr (Salvelinus fontinalis)
B. Angers
,
P. Magnan
,
M. Plante
,
L. Bernatchez
1999
Corpus ID: 46912329
The understanding of the relationships between environmental factors and evolutionary forces is of importance to preserve…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE