A Characterization of Minimum Spanning Tree-Like Metric Spaces

Momoko Hayamizu, Hiroshi Endo, Kenji Fukumizu

研究成果: Article査読

抄録

Recent years have witnessed a surge of biological interest in the minimum spanning tree (MST) problem for its relevance to automatic model construction using the distances between data points. Despite the increasing use of MST algorithms for this purpose, the goodness-of-fit of an MST to the data is often elusive because no quantitative criteria have been developed to measure it. Motivated by this, we provide a necessary and sufficient condition to ensure that a metric space on $n$ points can be represented by a fully labeled tree on $n$ vertices, and thereby determine when an MST preserves all pairwise distances between points in a finite metric space.

本文言語English
論文番号7447693
ページ(範囲)468-471
ページ数4
ジャーナルIEEE/ACM Transactions on Computational Biology and Bioinformatics
14
2
DOI
出版ステータスPublished - 2017 3 1
外部発表はい

ASJC Scopus subject areas

  • バイオテクノロジー
  • 遺伝学
  • 応用数学

フィンガープリント

「A Characterization of Minimum Spanning Tree-Like Metric Spaces」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル