Quasi-median networks
![]() | This article may be too technical for most readers to understand.(July 2012) |
This article needs additional citations for verification. (October 2017) |
The concept of a quasi-median network is a generalization of the concept of a median network that was introduced to represent multistate characters. Note that, unlike median networks, quasi-median networks are not split networks. A quasi-median network is defined as a phylogenetic network, the node set of which is given by the quasi-median closure of the condensed version of M (let M be a multiple sequence alignment of DNA sequences on X) and in which any two nodes are joined by an edge if and only if the sequences associated with the nodes differ in exactly one position. The quasi-median closure is defined as the set of all sequences that can be obtained by repeatedly taking the quasi-median of any three sequences in the set and then adding the result to the set.[1][2]
References
[edit]- ^ 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.