Niveau: Supérieur, Doctorat, Bac+8
DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT -- Fast Computation of Supertrees for Compatible Phylogenies with Nested Taxa Vincent Berry1 and Charles Semple2,3 3 October 2005 1Departement Informatique, L.I.R.M.M. - C.N.R.S., 161 rue Ada, 34392 Montpellier Cedex 5, France 2Biomathematics Research Centre, Department of Mathematics and Statistics, University of Can- terbury, Christchurch, New Zealand 3Corresponding author. Keywords. Phylogenetics, supertree methods, nested taxa, compatibility, strepsirrhine phylogeny. Abstract Typically, supertree methods combine a collection of source trees in which just the leaves are labelled by taxa. In such methods the resulting supertree is also leaf-labelled. An under- lying assumption in these methods is that, across all trees in the collection, no two of the taxa are nested; for example, “buttercups” and “plants” are nested taxa. Motivated by Page, the first supertree algorithm for allowing the source trees to collectively have nested taxa is called AncestralBuild. Here, in addition to taxa labelling the leaves, the source trees may have taxa labelling some of their interior nodes.
- time algorithm
- source tree
- ancestral relationships
- sensible supertree
- resolved
- ancestralbuild
- leaf-labelled trees
- source trees
- ancestralbuild can
- labelled trees