.png){kind=icon}
Return
Constructing and Drawing Regular Planar Split Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TCBB.2011.115.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Phylogenetic tree
split
planar split network
regular split network
flat split system
Journal
I
IF:
3.4
Papers:
3.3K
Citations:
6.4K
Organization
Cited Papers
ShareSaveQNet:: An agglomerative method for the construction of phylogenetic networks from weighted quartets
PREAI
ShareSaveDetection and frequency of recombination in tomato-infecting begomoviruses of South and Southeast Asia.png)
VIROLOGY JOURNAL
OAAI
VIROLOGY JOURNALIF3.8
OAAIShareSave
View more