An efficient exact algorithm for the minimum ultrametric tree problem

Authors:
Hsin-Fu Chen;Maw-Shang Chang
Affiliations:
Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan;Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan
Venue:
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Year:
2004

Citing 2
Cited 2

Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Linear algorithm for optimal path cover problem on interval graphs

Information Processing Letters

Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees

Journal of Parallel and Distributed Computing
Reconstructing an ultrametric galled phylogenetic network from a distance matrix

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimum ultrametric tree problem is an NP-hard evolutionary tree construction problem Wu et al proposed a branch-and-bound algorithm that solves the minimum ultrametric tree problem to optimality in [11] In this paper, we use a look-ahead approach to computing a tighter lower bound for a subproblem Besides we propose to use the persistent data structure to speedup the branch-and-bound algorithm Experimental results show that our algorithm outperforms the previous one We believe that the approach used in the paper can be adapted to speedup other branch-and-bound algorithms.