Consistency of the Neighbor-Net Algorithm

doi:10.1186/1748-7188-2-8

Algorithms for Molecular Biology

Volume 2

Viewing options:

Abstract
Full text
PDF (356KB)

Associated material:

Related literature:

Articles citing this article
on Google Scholar
on ISI Web of Science
on PubMed Central
Other articles by authors
on Google Scholar

Bryant D
Moulton V
Spillner A

on PubMed

Bryant D
Moulton V
Spillner A
Related articles/pages
on Google

on Google Scholar

on PubMed

Tools:

Post to:

Research

Consistency of the Neighbor-Net Algorithm

David Bryant¹ , Vincent Moulton² and Andreas Spillner²

¹Department of Mathematics, University of Auckland, Private Bag 92019, Auckland, NZ

²School of Computing Sciences, University of East Anglia, Norwich, NR4 7TJ, UK

author email corresponding author email

Algorithms for Molecular Biology 2007, 2:8doi:10.1186/1748-7188-2-8


Published:	28 June 2007

Abstract

Background

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.

Results

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.