Phylogenetic trees dissimilarity measure based on strict frequent splits set and its application for clustering

Authors:
Jakub Koperwas;Krzysztof Walczak
Affiliations:
Institute of Computer Science, Warsaw University of Technology, Warsaw, Poland;Institute of Computer Science, Warsaw University of Technology, Warsaw, Poland
Venue:
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Year:
2008

Citing 3
Cited 0

Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Case Study: Visualizing Sets of Evolutionary Trees

INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Frequent subsplit representation of leaf-labelled trees

EvoBIO'08 Proceedings of the 6th European conference on Evolutionary computation, machine learning and data mining in bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on clustering of leaf-labelled trees. As opposed to many other approaches from literature it is suitable not only for trees on the same leafset, but also for trees where the leafset varies. A new dissimilarity measure, constructed on the frequent subsplit term is used as the fundament of clustering technique. The clustering algorithm is designed to maximize the clustering quality measure. The computational time saving improvements are used. The initial results on phylogenetic and duplication trees are presented.