NDLI: Constructing and Drawing Regular Planar Split Networks

Content Provider	ACM Digital Library
Author	Nguyen, Binh Moulton, Vincent Spillner, Andreas
Abstract	Split networks are commonly used to visualize collections of bipartitions, also called splits, of a finite set. Such collections arise, for example, in evolutionary studies. Split networks can be viewed as a generalization of phylogenetic trees and may be generated using the SplitsTree package. Recently, the NeighborNet method for generating split networks has become rather popular, in part because it is guaranteed to always generate a circular split system, which can always be displayed by a planar split network. Even so, labels must be placed on the "outside” of the network, which might be problematic in some applications. To help circumvent this problem, it can be helpful to consider so-called flat split systems, which can be displayed by planar split networks where labels are allowed on the inside of the network too. Here, we present a new algorithm that is guaranteed to compute a minimal planar split network displaying a flat split system in polynomial time, provided the split system is given in a certain format. We will also briefly discuss two heuristics that could be useful for analyzing phylogeographic data and that allow the computation of flat split systems in this format in polynomial time.
Starting Page	395
Ending Page	407
Page Count	13
File Format	PDF
ISSN	15455963
DOI	10.1109/TCBB.2011.115
Volume Number	9
Issue Number	2
Journal	IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-03-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Phylogenetic tree, split, planar split network, regular split network, flat split system.
Content Type	Text
Resource Type	Article
Subject	Genetics Biotechnology Applied Mathematics

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

Constructing and Drawing Regular Planar Split Networks

Drawing Rooted Phylogenetic Networks

Constructing Splits Graphs

Regular Networks Can be Uniquely Constructed from Their Trees

Comparison of Tree-Child Phylogenetic Networks

Optimizing Phylogenetic Networks for Circular Split Systems

Drawing Rooted Phylogenetic Networks

Constructing splits graphs

Regular Networks Can be Uniquely Constructed from Their Trees

Constructing and Drawing Regular Planar Split Networks

Similar Documents

Constructing and Drawing Regular Planar Split Networks

Drawing Rooted Phylogenetic Networks

Constructing Splits Graphs

Regular Networks Can be Uniquely Constructed from Their Trees

Comparison of Tree-Child Phylogenetic Networks

Optimizing Phylogenetic Networks for Circular Split Systems

Drawing Rooted Phylogenetic Networks

Constructing splits graphs

Regular Networks Can be Uniquely Constructed from Their Trees

Constructing and Drawing Regular Planar Split Networks