Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time

Authors:
Ganeshkumar Ganapathysaravanabavan;Tandy Warnow
Affiliations:
-;-
Venue:
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Year:
2001

Citing 4
Cited 4

Faster scaling algorithms for network problems

SIAM Journal on Computing
Kaikoura tree theorems: computing the maximum agreement subtree

Information Processing Letters
On the agreement of many trees

Information Processing Letters
Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Modified Mincut Supertrees

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Clustering of Leaf-Labelled Trees on Free Leafset

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Solving the maximum agreement subtree and the maximum compatible tree problems on many bounded degree trees

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
On the approximation of computing evolutionary trees

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of computing a maximum compatible tree for k rooted trees when the maximum degree of all trees is bounded. We show that the problem can be solved in O(22kdnk) time, where n is the number of taxa in each tree, and every node in every tree has at most d children. Hence, a maximum compatible tree for k unrooted trees can be found in in O(22kdnk+1) time.