Clustering of Leaf-Labelled Trees on Free Leafset

Authors:
Jakub Koperwas;Krzysztof Walczak
Affiliations:
Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland;Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland
Venue:
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Year:
2007

Citing 3
Cited 0

Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time

WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Case Study: Visualizing Sets of Evolutionary Trees

INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Clustering of Leaf-Labelled Trees

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on the clustering of leaf-labelled trees on free leafset. It extends the previously proposed algorithms, designed for trees on the same leafset. The term z-equality is proposed and all the necessary consensus and distance notions are redefined with respect to z-equality. The clustering algorithms that focus on maximizing the quality measure for two representative trees are described, together with the measure itself. Finally, the promising results of experiments on tandem duplication trees are presented.