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.
The research has been partially supported by grant No 3 T11C 002 29 received from Polish Ministry of Education and Science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Koperwas, J., Walczak, K.: Clustering of leaf labeled-trees (Part I). In: ICANNGA 2007. LNCS, vol. 4431, pp. 702–710. Springer, Heidelberg (2007)
Ganeshkumar, G., Warnow, T.: Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol. 2149, pp. 156–163. Springer, Heidelberg (2001)
Barthelemy, J.P., McMorris, F.R.: The median procedure for n-trees. J. Classif. 3, 329–334 (1986)
Bryant, D.: Building trees, hunting for trees, and comparing trees. Theory And Method. In: Phylogenetic Analysis. Ph.D Thesis University of Canterbury (1997)
Elemento, O. et al.: Reconstructing the duplication history of tandemly repeated genes. Molecular Biology and Evolution 19, 278–288 (2002)
Tandem Repeats Database, http://tandem.bu.edu
Stockham, C., Wang, L.S., Warnow, T.: Statistically based postprocessing of phylogenetic analysis by clustering. Bionformatics 18, 285–293 (2002)
Amenta, N., Klingner, J.: Case study: Visualizing sets of evolutionary trees. In: 8th IEEE Symposium on Information Visualization, pp. 71–74. IEEE Computer Society Press, Los Alamitos (2002)
Akutsu, T., Halldrsson, M.: On the approximation of largest common point sets and largest common subtrees. Unpublished manuscript (1997)
Gascuel, O. et al.: The combinatorics of tandem duplication trees. Systematic Biology 52(1), 110–118 (2003)
Bille, P.: Tree edit distance, alignment distance and inclusion. Technical report TR-2003-23 in IT University Technical Report Series (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koperwas, J., Walczak, K. (2007). Clustering of Leaf-Labelled Trees on Free Leafset. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds) Rough Sets and Intelligent Systems Paradigms. RSEISP 2007. Lecture Notes in Computer Science(), vol 4585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73451-2_77
Download citation
DOI: https://doi.org/10.1007/978-3-540-73451-2_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73450-5
Online ISBN: 978-3-540-73451-2
eBook Packages: Computer ScienceComputer Science (R0)