Properties of supertree methods in the consensus setting

  • Wilkinson M
  • Cotton J
  • Lapointe F
 et al. 
  • 55


    Mendeley users who have this article in their library.
  • 33


    Citations of this article.


Supertree methods (SMs) are techniques for inferring (super)trees from sets of (input) trees. Classical consensus methods are SMs that were designed for the special case where input trees have identical leaf sets. The need for methods that can also combine information from input trees with nonidentical leaf sets has led to many alternative SMs. Some of these SMs are generalizations from conservative consensus methods (strict and semistrict) that do not resolve input tree conflicts (e.g., Gordon, 1986; Goloboff and Pol, 2002). Our focus here is on more liberal SMs, those capable of resolving conflicts among input trees. Liberal SMs comprise the majority of described methods and have been the most used in practice by biologists seeking well-resolved phylogenies. However, today's practitioners are confronted with choosing among a potentially bewildering array of liberal SM(s).

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Mark Wilkinson

  • James A. Cotton

  • François Joseph Lapointe

  • Davide Pisani

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free