Maximum Agreement Supertree
Years and Authors of Summarized Original Work
2005; Jansson, Ng, Sadakane, Sung
2007; Berry, Nicolas
2010; Guillemot, Berry
2011; Hoang, Sung
A phylogenetic tree is a rooted, unordered tree whose leaves are distinctly labeled and whose internal nodes have degree at least two. By distinctly labeled, we mean that no two leaves in the tree have the same label. Let T be a phylogenetic tree with a leaf label set S. For any subset S′ of S, the topological restriction of T to S′ (denoted by T | S′) is the tree obtained from T by deleting all nodes which are not on any path from the root to a leaf in S′ along with their incident edges and then contracting every edge between a node having just one child and its child. See Fig. 1 for an illustration. For any phylogenetic tree T, denote its set of leaf labels by Λ(T).
KeywordsPhylogenetic tree, Maximum agreement supertree, Rooted triplet, NP-hardness, Fixed-parameter tractability
JJ was funded by the Hakubi Project at Kyoto University and KAKENHI grant number 26330014.
- 4.Bryant D (1997) Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis. PhD thesis, University of Canterbury, ChristchurchGoogle Scholar
- 7.Ga̧sieniec L, Jansson J, Lingas A, Östlin A (1999) On the complexity of constructing evolutionary trees. J Comb Optim 3(2–3):183–197Google Scholar
- 14.Kearney P (2002) Phylogenetics and the quartet method. In: Current topics in computational molecular biology. MIT, Cambridge pp 111–133Google Scholar