On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees

Authors:
Ting Chen;Ming-Yang Kao
Affiliations:
-;-
Venue:
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Year:
1999

Citing 2
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Inferring Evolutionary Trees with Strong Combinatorial Evidence

COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the informational asymmetry for constructing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given species. We show that the tallest ultrametric tree exists and can be constructed in O(n2) time, while the existence of the shortest ultrametric tree depends on whether the lower bounds are ultrametric. The tallest tree construction algorithm gives a very simple solution to the construction of an ultrametric tree. We also provide an efficient O(n2)-time algorithm for checking the uniqueness of an ultrametric tree, and study a query problem for testing whether an ultrametric tree satisfies both upper and lower bounds.