2000
DOI: 10.1016/s0166-218x(00)00202-x
|View full text |Cite
|
Sign up to set email alerts
|

A supertree method for rooted trees

Abstract: The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of classification, particularly evolutionary biology. In this paper, we describe a new technique for amalgamating rooted phylogenetic trees. This appears to be the first such method to provably exhibit particular desirable properties which we list and establish.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
131
0
1

Year Published

2002
2002
2015
2015

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 154 publications
(132 citation statements)
references
References 13 publications
(16 reference statements)
0
131
0
1
Order By: Relevance
“…R. Soc. B 370: 20140337 method [40], representing special cases where all the input trees have the same leaf set [41]. Supertree methods can be used in genomics to combine partially overlapping gene trees to make inferences about the species phylogeny and/or to investigate patterns of congruence and incongruence between realized supertrees and specific sets of gene trees.…”
Section: Using Supertrees To Test Hypotheses Of Symbiogenesis and Larmentioning
confidence: 99%
“…R. Soc. B 370: 20140337 method [40], representing special cases where all the input trees have the same leaf set [41]. Supertree methods can be used in genomics to combine partially overlapping gene trees to make inferences about the species phylogeny and/or to investigate patterns of congruence and incongruence between realized supertrees and specific sets of gene trees.…”
Section: Using Supertrees To Test Hypotheses Of Symbiogenesis and Larmentioning
confidence: 99%
“…Several methods of constructing supertrees have been devised (Baum 1992;Purvis 1995;Semple & Steel 2000;Wilkinson et al 2001) and a variety of supertrees have been constructed using phylogenetic trees based on molecular and/or morphological data (e.g. Purvis 1995;Daubin et al 2001;Pisani et al 2002).…”
Section: Introductionmentioning
confidence: 99%
“…We define this problem as the M IP T (Most Informative Pruned Tree) problem. To evaluate the informativeness of a tree we can use either the number of triplets of T (see [21,22,11]) that, for binary trees, depends only on the number of leaves, or the CIC criterion (see [23,12]). The CIC of a not fully resolved and incomplete 2 tree T with |L(T )| leaves among the n possible is a function of both the …”
Section: Computing a Largest Duplication-free Subtree Of A Mul Treementioning
confidence: 99%