Chapter

Combinatorial Pattern Matching

Volume 1075 of the series Lecture Notes in Computer Science pp 234-252

Date:

The asymmetric median tree — A new model for building consensus trees

  • Cynthia PhillipsAffiliated withSandia National LabsDepartment of Computer and Information Science, University of Pennsylvania
  • , Tandy J. WarnowAffiliated withSandia National LabsDepartment of Computer and Information Science, University of Pennsylvania

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Inferring the consensus of a set of different evolutionary trees for a given species set is a well-studied problem, for which several different models have been proposed. In this paper, we propose a new optimization problem for consensus tree construction, which we call the asymmetric median tree, or AMT. Our main theoretical result is the equivalence between the asymmetric median tree problem on k trees and the maximum independent set (MIS) problem on k-colored graphs. Although the problem is NP-hard for three or more trees, we have polynomial time algorithms to construct the AMT for two trees and an approximation algorithm for three or more trees. We define a measure of phylogenetic resolution and show that our algorithms (both exact and approximate) produce consensus trees that on every input are at least as resolved as the standard models (strict consensus and majority tree) in use. Finally, we show that the AMT combines desirable features of many of the standard consensus tree models in use.