Counting Faces in Split Networks

  • Lichen Bao
  • Sergey Bereg
Conference paper

DOI: 10.1007/978-3-642-01551-9_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5542)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Lichen Bao
    • 1
  • Sergey Bereg
    • 1
  1. 1.Department of Computer Science Erik Jonsson School of Engineering & Computer ScienceThe University of Texas at DallasRichardsonUSA

Personalised recommendations