NeighborNet: an agglomerative method for the construction of planar phylogenetic networks

Bryant, D. and Moulton, V. (2002) NeighborNet: an agglomerative method for the construction of planar phylogenetic networks. In: Algorithms in Bioinformatics. Lecture Notes in Computer Science, 2452 . Springer Berlin / Heidelberg, ITA, pp. 375-391. ISBN 978-3-540-44211-0

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

Abstract

We introduce NeighborNet, a network construction and data representation method that combines aspects of the neighbor joining (NJ) and SplitsTree. Like NJ, NeighborNet uses agglomeration: taxa are combined into progressively larger and larger overlapping clusters. Like SplitsTree, NeighborNet constructs networks rather than trees, and so can be used to represent multiple phylogenetic hypotheses simultaneously, or to detect complex evolutionary processes like recombination, lateral transfer and hybridization. NeighborNet tends to produce networks that are substantially more resolved than those made with SplitsTree. The method is efficient (O(n3) time) and is well suited for the preliminary analyses of complex phylogenetic data. We report results of three case studies: one based on mitochondrial gene order data from early branching eukaryotes, another based on nuclear sequence data from New Zealand alpine buttercups (Ranunculi), and a third on poorly corrected synthetic data.

Item Type: Book Section
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 27 Jul 2011 12:21
Last Modified: 22 Apr 2020 10:22
URI: https://ueaeprints.uea.ac.uk/id/eprint/21612
DOI: 10.1007/3-540-45784-4_28

Actions (login required)

View Item View Item