Consistency of the QNet algorithm for generating planar split networks from weighted quartets

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that allow the representation of conflicting signals or alternative evolutionary histories in a single diagram. Recently the Quartet-Net or "QNet" method was introduced, a method for computing a special kind of phylogenetic network called a split network from a collection of weighted quartet trees (i.e. phylogenetic trees with 4 leaves). This can be viewed as a quartet analogue of the distance-based Neighbor-Net (NNet) method for constructing outer-labeled planar split networks. In this paper, we prove that QNet is a consistent method, that is, we prove that if QNet is applied to a collection of weighted quartets arising from a circular split weight function, then it will return precisely this function. This key property of QNet not only ensures that it is guaranteed to produce a tree if the input corresponds to a tree, and an outer-labeled planar split network if the input corresponds to such a network, but also provides the main guiding principle for the design of the method. © 2008 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Grünewald, S., Moulton, V., & Spillner, A. (2009). Consistency of the QNet algorithm for generating planar split networks from weighted quartets. Discrete Applied Mathematics, 157(10), 2325–2334. https://doi.org/10.1016/j.dam.2008.06.038

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free