Split networks

This article has multiple issues. Please help improve it or discuss these issues on the talk page.

This article has no lead section. Please help by adding an introductory section to this article. For more information, see the layout guide, and Wikipedia's lead section guidelines. (August 2012)

This article includes a list of references, but its sources remain unclear because it has insufficient inline citations. Please help to improve this article by introducing more precise citations. (July 2012)

This article may be too technical for most readers to understand. Please help improve this article to make it understandable to non-experts, without removing the technical details. The talk page may contain suggestions. (July 2012)

For a given set of taxa like X, and a set of splits S on X, usually together with a non-negative weighting, which may represent character changes distance, or mayalso 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 s in S is represented by an array of parallel edges in network.

A split network N can be obtained from a number of different types of data:

Split networks from distances
Split networks from trees
Split networks from sequences
Split networks from quartets

References

^ Bandelt, H-J; Dress, AWM (1992). "A canonical decomposition theory for metrics on a finite set". Adv Math 92: 47–105.

↑Jump back a section

Split networks

References

Further reading