NDLI: Groves of Phylogenetic Trees

Content Provider	Springer Nature Link
Author	Eulenstein, Oliver Sanderson, Michael J. Piaggio Talice, Raul Ané, Cécile
Copyright Year	2009
Abstract	A major challenge in biological sciences is the reconstruction of the Tree of Life. To this effect, large genomic databases like GenBank and SwissProt are being mined for clusters from which phylogenies can be inferred. Systematists and comparative biologists commonly combine such phylogenies into informative supertrees that reveal information which was not explicitly displayed in any of the original phylogenies. However, whether a supertree is informative depends on particular overlap properties among the clusters from which it originates. In this work we formally introduce the concept of groves — sets of clusters with the potential to construct informative supertrees. Thus maximal potential candidate clusters for informative supertree construction can be identified in large databases through groves, prior to inferring trees for each cluster. Groves also have the potential to lead to informative supermatrix construction. We developed methods that (i) efficiently identify particular types of groves and (ii) find lower and upper bounds on the minimal number of groves needed to cover all the trees or data sets in a database. Finally, we apply our methods to the green plant sequences from GenBank.
Ending Page	167
Page Count	29
Starting Page	139
File Format	PDF
ISSN	02180006
e-ISSN	02193094
Journal	Annals of Combinatorics
Issue Number	2
Volume Number	13
Language	English
Publisher	SP Birkhäuser Verlag Basel
Publisher Date	2009-06-26
Publisher Place	Basel
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Trees supermatrix triplets clustering evolution Combinatorics Graph theory (including graph drawing) supertree 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

Mathematical Aspects of Phylogenetic Groves

Extending the Limits of Supertree Methods

A Subdivision Approach to Maximum Parsimony

Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems

Optimizing Phylogenetic Diversity with Ecological Constraints

Counting Phylogenetic Networks

Phylogenetic Diversity Over an Abelian Group

Cuts, Trees and ℓ1-Embeddings of Graphs*

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

Groves of Phylogenetic Trees

Similar Documents

Mathematical Aspects of Phylogenetic Groves

Extending the Limits of Supertree Methods

A Subdivision Approach to Maximum Parsimony

Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems

Optimizing Phylogenetic Diversity with Ecological Constraints

Counting Phylogenetic Networks

Phylogenetic Diversity Over an Abelian Group

Cuts, Trees and ℓ1-Embeddings of Graphs*

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

Groves of Phylogenetic Trees