Consistency of the Neighbor-Net Algorithm

<p>Abstract</p> <p>Background</p> <p>Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an input distance matrix, Neighbor-Net produces a phylogenetic network,...

Full description

Bibliographic Details
Main Authors: Moulton Vincent, Bryant David, Spillner Andreas
Format: Article
Language:English
Published: BMC 2007-06-01
Series:Algorithms for Molecular Biology
Online Access:http://www.almob.org/content/2/1/8
Description
Summary:<p>Abstract</p> <p>Background</p> <p>Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an input distance matrix, Neighbor-Net produces a phylogenetic network, a generalization of an evolutionary or phylogenetic tree which allows the graphical representation of conflicting phylogenetic signals.</p> <p>Results</p> <p>In general, any network construction method should not depict more conflict than is found in the data, and, when the data is fitted well by a tree, the method should return a network that is close to this tree. In this paper we provide a formal proof that Neighbor-Net satisfies both of these requirements so that, in particular, Neighbor-Net is statistically consistent on circular distances.</p>
ISSN:1748-7188