Jump to content

Split networks

From Wikipedia, the free encyclopedia

For a given set of taxa, and a set of splits S on the taxa, usually together with a non-negative weighting, which may represent character changes distance, or may also have a more abstract interpretation, if the set of splits S is compatible, then it can be represented by an unrooted phylogenetic tree and each edge in the tree corresponds to exactly one of the splits. More generally, S can always be represented by a split network,[1] which is an unrooted phylogenetic network with the property that every split in S is represented by an array of parallel edges in the network.

References

[edit]
  1. ^ Bandelt, Hans-Jürgen; Dress, Andreas W. M. (1992). "A canonical decomposition theory for metrics on a finite set". Advances in Mathematics. 92: 47–105. doi:10.1016/0001-8708(92)90061-o.

Further reading

[edit]