NDLI: SuperQ: Computing Supernetworks from Quartets

Content Provider	IEEE Xplore Digital Library
Author	Grunewald, S. Spillner, A. Bastkowski, S. Bogershausen, A. Moulton, V.
Copyright Year	2004
Abstract	Supertrees are a commonly used tool in phylogenetics to summarize collections of partial phylogenetic trees. As a generalization of supertrees, phylogenetic supernetworks allow, in addition, the visual representation of conflict between the trees that is not possible to observe with a single tree. Here, we introduce SuperQ, a new method for constructing such supernetworks (SuperQ is freely available at www.uea.ac.uk/computing/superq.). It works by first breaking the input trees into quartet trees, and then stitching these together to form a special kind of phylogenetic network, called a split network. This stitching process is performed using an adaptation of the QNet method for split network reconstruction employing a novel approach to use the branch lengths from the input trees to estimate the branch lengths in the resulting network. Compared with previous supernetwork methods, SuperQ has the advantage of producing a planar network. We compare the performance of SuperQ to the Z-closure and Q-imputation supernetwork methods, and also present an analysis of some published data sets as an illustration of its applicability.
Sponsorship	IEEE Computer Society
Page Count	10
File Size	1298885
Starting Page	151
Ending Page	160
File Format	PDF
ISSN	15455963
Volume Number	10
Issue Number	1
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Phylogeny Vegetation Computational biology Bioinformatics Visualization Data visualization Electronic mail split network Supertree phylogenetic network consensus network supernetwork
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Genetics Biotechnology

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

Quartets MaxCut: A Divide and Conquer Quartets Algorithm

Constructing and Drawing Regular Planar Split Networks

Optimizing Phylogenetic Networks for Circular Split Systems

CSD Homomorphisms between Phylogenetic Networks

Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems

Uncovering Hidden Phylogenetic Consensus in Large Data Sets

Reconstructing a Phylogenetic Level-1 Network from Quartets

A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees

Computing Phylogenetic Diversity for Split Systems

SuperQ: Computing Supernetworks from Quartets

Similar Documents

Quartets MaxCut: A Divide and Conquer Quartets Algorithm

Constructing and Drawing Regular Planar Split Networks

Optimizing Phylogenetic Networks for Circular Split Systems

CSD Homomorphisms between Phylogenetic Networks

Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems

Uncovering Hidden Phylogenetic Consensus in Large Data Sets

Reconstructing a Phylogenetic Level-1 Network from Quartets

A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees

Computing Phylogenetic Diversity for Split Systems

SuperQ: Computing Supernetworks from Quartets