Sensitivity Analysis of Bipartition Dissimilarity under Tree Rearrangement Operations

DOI

10.2991/lemcs-14.2014.246How to use a DOI?

Keywords

leaf labeled trees; Robinson-Foulds distance; bipartition dissimilarity; sensitivity analysis; tree rearrangement operations

Abstract

Trees are a powerful structure for representing hierarchical relations in a natural way. Comparison of trees is a recurrent task in various computer science related fields. The widely used Robinson-Foulds distance for comparing leaf labeled trees is overly sensitive to very small changes in the tree. The measure of bipartition dissimilarity refines Robinson-Foulds metric by comparing the quality of the tree bipartitions instead of their quantity. Sensitivity analysis is used in this paper which shows that bipartition dissimilarity has smaller sensitivity to small modifications in the tree.

Copyright

© 2014, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiao Xin
AU  - Xinbo Li
PY  - 2014/05
DA  - 2014/05
TI  - Sensitivity Analysis of Bipartition Dissimilarity under Tree Rearrangement Operations
BT  - Proceedings of the International Conference on Logistics, Engineering, Management and Computer Science
PB  - Atlantis Press
SP  - 1101
EP  - 1104
SN  - 1951-6851
UR  - https://doi.org/10.2991/lemcs-14.2014.246
DO  - 10.2991/lemcs-14.2014.246
ID  - Xin2014/05
ER  -