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

Gruenewald, S, Moulton, V ORCID: https://orcid.org/0000-0001-9371-6435 and Spillner, A (2009) Consistency of the QNet algorithm for generating planar split graphs from weighted quartets. Discrete Applied Mathematics, 157 (10). pp. 2325-2334.

Full text not available from this repository. (Request a copy)

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.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
Depositing User:	Vishal Gautam
Date Deposited:	11 Mar 2011 16:22
Last Modified:	12 Jan 2023 14:30
URI:	https://ueaeprints.uea.ac.uk/id/eprint/22265
DOI:	10.1016/j.dam.2008.06.038

Actions (login required)

View Item