Linear-time algorithms for two subtree-comparison problems on phylogenetic trees with different species

Authors:
Sun-Yuan Hsieh
Affiliations:
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan
Venue:
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2006

Citing 8
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
On the agreement of many trees

Information Processing Letters
On the complexity of comparing evolutionary trees

Discrete Applied Mathematics - Special volume on computational molecular biology
Sparse Dynamic Programming for Evolutionary-Tree Comparison

SIAM Journal on Computing
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms

SIAM Journal on Computing
Clustering Algorithms

Clustering Algorithms
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

SIAM Journal on Computing
Approximating the Maximum Isomorphic Agreement Subtree Is Hard

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

Phylogenetic trees are an important tool to help in the understanding of relationships between objects that evolve through time, in particular molecular sequences. In this paper, we consider two subtree-comparison problems on phylogenetic trees. Given a set of k phylogenetic trees whose leaves are drawn from {1,2,...,n} and the leaves for two arbitrary trees are not necessary the same, we first present a linear-time algorithm to final all maximal leaf-agreement subtrees. Based on this result, we also present a linear time algorithm to find maximal all-agreement isomorphic subtrees.