@inbook{5e0be8f123d241d59d41856d7dd49907,
title = "NeighborNet: an agglomerative method for the construction of planar phylogenetic networks",
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.",
author = "David Bryant and Vincent Moulton",
year = "2002",
doi = "10.1007/3-540-45784-4_28",
language = "English",
isbn = "978-3-540-44211-0",
volume = "2452",
series = "Lecture Notes in Computer Science",
publisher = "Springer Berlin / Heidelberg",
pages = "375--391",
editor = "Roderic Guig{\'o} and Dan Gusfield",
booktitle = "Algorithms in Bioinformatics",
note = "2nd International Workshop on Algorithms in Bioinformatics, WABI 2002 ; Conference date: 17-09-2002 Through 21-09-2002",
}