Split networks

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (July 2012) (Learn how and when to remove this message) This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (July 2012) (Learn how and when to remove this message) (Learn how and when to remove this message)

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.

• Huson, Daniel H.; Scornavacca, Celine (2011). "A survey of combinatorial methods for phylogenetic networks". Genome Biology and Evolution. 3: 23–35. doi:10.1093/gbe/evq077. PMC 3017387. PMID 21081312.
• Huson, Daniel H.; Rupp, Regula; Scornavacca, Celine (2011). Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press. ISBN 978-0521755962.

This genetics article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e