Consistency of the Neighbor-Net algorithm

Tools

Bryant, David, Moulton, Vincent ORCID: https://orcid.org/0000-0001-9371-6435 and Spillner, Andreas (2007) Consistency of the Neighbor-Net algorithm. Algorithms for Molecular Biology, 2 (8). ISSN 1748-7188

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

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.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Computational Biology > Computational biology of RNA (former - to 2018) Faculty of Science > Research Groups > Computational Biology > Phylogenetics (former - to 2018) Faculty of Science > Research Groups > Computational Biology Faculty of Science > Research Groups > Norwich Epidemiology Centre Faculty of Medicine and Health Sciences > Research Groups > Norwich Epidemiology Centre
Related URLs:	http://dx.doi.org/10.1186/1748-7188-2-8
Depositing User:	EPrints Services
Date Deposited:	01 Oct 2010 13:41
Last Modified:	15 Jun 2023 18:31
URI:	https://ueaeprints.uea.ac.uk/id/eprint/2952
DOI:	10.1186/1748-7188-2-8

Actions (login required)

View Item