The MinMax Squeeze: Guaranteeing a minimal tree for population data

Holland, B., Huber, K.T., Penny, D. and Moulton, V. ORCID: (2005) The MinMax Squeeze: Guaranteeing a minimal tree for population data. Molecular Biology and Evolution, 22 (2). pp. 235-242. ISSN 0737-4038

Full text not available from this repository. (Request a copy)


We report that for population data, where sequences are very similar to one another, it is often possible to use a two-pronged (MinMax Squeeze) approach to prove that a tree is the shortest possible under the parsimony criterion. Such population data can be in a range where parsimony is a maximum likelihood estimator. This is in sharp contrast to the case with species data, where sequences are much further apart and the problem of guaranteeing an optimal phylogenetic tree is known to be computationally prohibitive for realistic numbers of species, irrespective of whether likelihood or parsimony is the optimality criterion. The Squeeze uses both an upper bound (the length of the shortest tree known) and a lower bound derived from partitions of the columns (the length of the shortest tree possible). If the two bounds meet, the shortest known tree is thus proven to be a shortest possible tree. The implementation is first tested on simulated data sets and then applied to 53 complete human mitochondrial genomes. The shortest possible trees for those data have several significant improvements from the published tree. Namely, a pair of Australian lineages comes deeper in the tree (in agreement with archaeological data), and the non-African part of the tree shows greater agreement with the geographical distribution of lineages.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 09 Jun 2011 16:34
Last Modified: 24 Oct 2022 02:20
DOI: 10.1093/molbev/msi010

Actions (login required)

View Item View Item