<%@ Page Language="C#" MasterPageFile="~/Main.master" AutoEventWireup="true" Title="Volume10 Issue1" %>
Extending the Limits of Supertree Methods
Magnus Bordewich1, Gareth Evans2 and Charles Semple2
1Department of Computer Science, Durham University, Durham, United Kingdom
m.j.r.bordewich@durham.ac.uk
2Biomathematics Research Centre, Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand
gee16@student.canterbury.ac.nz, c.semple@math.canterbury.ac.nz
Annals of Combinatorics 10 (1) p.31-51 March, 2006
AMS Subject Classification: 05C05; 92D15
Abstract:
Recently, two exact polynomial-time supertree methods have been developed in which the traditional input of rooted leaf-labelled trees has been extended in two separate ways. The first method, called , allows for the inclusion of relative divergence dates and the second method, called , allows for the inclusion of rooted trees in which some of the interior vertices as well as the leaves are labelled. The latter is particular useful for when one has information that includes nested taxa. In this paper, we present two supertree methods that unite and generalise and . The first method is polynomial time and combines the allowable inputs of and . It determines if the original input is compatible, in which case it outputs an appropriate `ranked semi-labelled tree'. The second method lists all `ranked semi-labelled trees' that are consistent with the original input. While there may be an exponential number of such trees, the second method outputs the next such tree in the list in polynomial time.
Keywords: Supertree methods, nested taxa, AncestralBuild, RankedTree

References:

1. A.V. Aho, S. Yehoshua, T.G. Szymanski, and J.D. Ullman, Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SIAM J. Comput. 10 (1981) 405--421.

2. M. Bordewich and C. Semple, Counting consistent phylogenetic trees is #P-complete, Adv. in Appl. Math. 33 (2004) 416--430.

3. D. Bryant, C. Semple, and M. Steel, Supertree methods for ancestral divergence dates and other applications, In: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, O. Bininda-Emonds, Ed., Computational Biology Series, Kluwer, (2004) pp. 129--150.

4. M. Constantinescu and D. Sankoff, An efficient algorithm for supertrees, J. Classification 12 (1995) 101--112.

5. P. Daniel, W. Hordijk, R.D.M. Page, C. Semple, and M. Steel, Supertree algorithms for ancestral divergence dates and nested taxa, Bioinformatics 20 (2004) 2355--2360.

6. P. Daniel and C. Semple, Supertree algorithms for nested taxa, In: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, O. Bininda-Emonds, Ed., Computational Biology Series, Kluwer, (2004) pp. 151--171.

7. P. Daniel and C. Semple, A class of general supertree methods for nested taxa, SIAM J. Discrete Math., to appear.

8. M.P. Ng and N.C. Wormald, Reconstruction of rooted trees from subtrees, Discrete Appl. Math. 69 (1996) 19--31.

9. C. Semple, Reconstructing minimal rooted trees, Discrete Appl. Math. 127 (2003) 489--503.

10. C. Semple and M. Steel, Phylogenetics, Oxford University Press, 2003.