Counting Faces in Split Networks

Authors:
Lichen Bao;Sergey Bereg
Affiliations:
Department of Computer Science Erik Jonsson School of Engineering & Computer Science, The University of Texas at Dallas, Richardson, USA TX 75080;Department of Computer Science Erik Jonsson School of Engineering & Computer Science, The University of Texas at Dallas, Richardson, USA TX 75080
Venue:
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Year:
2009

Citing 9
Cited 2

NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Constructing Splits Graphs

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution

Bioinformatics
A pattern recognition-based approach for phylogenetic network construction with constrained recombination

Pattern Recognition
The Fine Structure of Galls in Phylogenetic Networks

INFORMS Journal on Computing
Clustered SplitsNetworks

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Minimum recombination histories by branch and bound

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A fundamental decomposition theory for phylogenetic networks and incompatible characters

RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology

Constructing and Drawing Regular Planar Split Networks

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Optimizing Phylogenetic Networks for Circular Split Systems

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

SplitsTree is a popular program for inferring and visualizing various phylogenetic networks including split networks. Split networks are useful for realizing metrics that are linear combinations of split metrics. We show that the realization is not unique in some cases and design an algorithm for computing split networks with minimum number of faces. We also prove that the minimum number of faces in a split network is equal to the number of pairs of incompatible splits.