Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species

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.

[1]  Dan Gusfield,et al.  Efficient algorithms for inferring evolutionary trees , 1991, Networks.

[2]  Yaw-Ling Lin,et al.  Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome , 2003, ISAAC.

[3]  W. H. Day.  Optimal algorithms for comparing trees with labeled leaves , 1985 .

[4]  K. Strimmer,et al.  Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies , 1996 .

[5]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[6]  Mikkel Thorup,et al.  An O(n log n) algorithm for the maximum agreement subtree problem for binary trees , 1996, SODA '96.

[7]  Tao Jiang,et al.  On the Complexity of Comparing Evolutionary Trees , 1996, Discret. Appl. Math..

[8]  Mikkel Thorup,et al.  Sparse Dynamic Programming for Evolutionary-Tree Comparison , 1997, SIAM J. Comput..

[9]  Mikkel Thorup,et al.  On the Agreement of Many Trees , 1995, Inf. Process. Lett..

[10]  Y. Quentin,et al.  Two-component systems in Pseudomonas aeruginosa: why so many? , 2000, Trends in microbiology.

[11]  J. Felsenstein.  Numerical Methods for Inferring Evolutionary Trees , 1982, The Quarterly Review of Biology.

[12]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

[13]  N. Saitou,et al.  The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.

[14]  J. Hoch,et al.  Two-component signal transduction , 1995 .

[15]  W. Fitch.  Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[16]  Paola Bonizzoni,et al.  Approximating the Maximum Isomorphic Agreement Subtree Is Hard , 2000, CPM.

[17]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[18]  Amihood Amir,et al.  Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms , 1997, SIAM J. Comput..