NDLI: Extending the Limits of Supertree Methods

Content Provider	Springer Nature Link
Author	Bordewich, Magnus Semple, Charles Evans, Gareth
Copyright Year	2006
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 RankedTree, allows for the inclusion of relative divergence dates and the second method, called AncestralBuild, allows for the inclusion of rooted trees in which some of the interior vertices as well as the leaves are labelled. The latter is particularly useful for when one has information that includes nested taxa. In this paper, we present two supertree methods that unite and generalise RankedTree and AncestralBuild. The first method is polynomial time and combines the allowable inputs of RankedTree and AncestralBuild. 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.
Ending Page	51
Page Count	21
Starting Page	31
File Format	PDF
ISSN	02180006
e-ISSN	02193094
Journal	Annals of Combinatorics
Issue Number	1
Volume Number	10
Language	English
Publisher	Birkhäuser-Verlag
Publisher Date	2006-01-01
Publisher Place	Basel
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	AncestralBuild Trees Supertree methods nested taxa RankedTree Combinatorics Problems related to evolution
Content Type	Text
Resource Type	Article
Subject	Discrete Mathematics and Combinatorics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Class of General Supertree Methods for Nested Taxa

Groves of Phylogenetic Trees

Patching upX-trees

Accumulation Phylogenies

Bounds on the Size of the TBR Unit-Neighbourhood

Properties of Subtree-Prune-and-Regraft Operations on Totally-Ordered Phylogenetic Trees

On the Ancestral Compatibility of Two Phylogenetic Trees with Nested Taxa

Optimizing Phylogenetic Diversity with Ecological Constraints

A Framework for Representing Reticulate Evolution

Extending the Limits of Supertree Methods

Similar Documents

A Class of General Supertree Methods for Nested Taxa

Groves of Phylogenetic Trees

Patching upX-trees

Accumulation Phylogenies

Bounds on the Size of the TBR Unit-Neighbourhood

Properties of Subtree-Prune-and-Regraft Operations on Totally-Ordered Phylogenetic Trees

On the Ancestral Compatibility of Two Phylogenetic Trees with Nested Taxa

Optimizing Phylogenetic Diversity with Ecological Constraints

A Framework for Representing Reticulate Evolution

Extending the Limits of Supertree Methods