Counting Faces in Split Networks
- Cite this paper as:
- Bao L., Bereg S. (2009) Counting Faces in Split Networks. In: Măndoiu I., Narasimhan G., Zhang Y. (eds) Bioinformatics Research and Applications. ISBRA 2009. Lecture Notes in Computer Science, vol 5542. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.