Frequent subsplit representation of leaf-labelled trees

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:
EvoBIO'08 Proceedings of the 6th European conference on Evolutionary computation, machine learning and data mining in bioinformatics
Year:
2008

Citing 2
Cited 1

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)

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

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose an innovative method of representing common knowledge in leaf-labelled trees as a set of frequent subsplits, together with its interpretation. Our technique is suitable for trees built on the same leafset as well as for trees where the leafset varies. The proposed solution has a very good interpretation, as it returns different, maximal sets of taxa that are connected with the same relations in the input trees. In contrast to other methods known in literature it does not necessarily result in one tree, but may result in a profile of trees, which are usually more resolved than the consensus trees.