Note: Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species

Authors:
Sun-Yuan Hsieh
Affiliations:
Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 701, Taiwan
Venue:
Theoretical Computer Science
Year:
2007

Citing 14
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
On the subtree isomorphism problem for ordered trees

Information Processing Letters
On finding common subtrees

Theoretical Computer Science
On the agreement of many trees

Information Processing Letters
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
On an algorithm of Zemlyachenko for subtree isomorphism

Information Processing Letters
Pattern Matching in Trees

Journal of the ACM (JACM)
Inferring evolutionary trees with strong combinatorial evidence

Theoretical Computer Science - computing and combinatorics
An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings

Journal of Algorithms
Clustering Algorithms

Clustering Algorithms
Algorithms on Trees and Graphs

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

SIAM Journal on Computing
An improved algorithm for the maximum agreement subtree problem

Information Processing Letters

Quantified Score

Hi-index	5.23

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 descendent 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 the maximal leaf-agreement descendent subtrees. Based on this result, we also present a linear-time algorithm to find all the maximal leaf-agreement isomorphic descendent subtrees.