%0 Journal Article %1 Bryant07 %A Bryant, David %A Moulton, Vincent %A Spillner, Andreas %C Department of Mathematics, University of Auckland, Private Bag 92019, Auckland, NZ. bryant@math.auckland.ac.nz %D 2007 %J Algorithms Mol Biol %K from:davidjamesbryant %P 8 %R 10.1186/1748-7188-2-8 %T Consistency of the neighbor-net algorithm. %U http://dx.doi.org/10.1186/1748-7188-2-8 %V 2 %X 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.

@article{Bryant07, 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.}, added-at = {2009-05-14T15:34:03.000+0200}, address = {Department of Mathematics, University of Auckland, Private Bag 92019, Auckland, NZ. bryant@math.auckland.ac.nz}, au = {Bryant, D and Moulton, V and Spillner, A}, author = {Bryant, David and Moulton, Vincent and Spillner, Andreas}, biburl = {https://www.bibsonomy.org/bibtex/24d37922d55deaa71644c01b706e86c53/compevol}, crdt = {2007/06/29 09:00}, da = {20070816}, date-modified = {2009-01-28 13:04:38 +1300}, dcom = {20070821}, dep = {20070628}, doi = {10.1186/1748-7188-2-8}, edat = {2007/06/29 09:00}, interhash = {734a1a44a1c8141e9a461d2cfd7983b0}, intrahash = {4d37922d55deaa71644c01b706e86c53}, issn = {1748-7188 (Electronic)}, jid = {101265088}, journal = {Algorithms Mol Biol}, jt = {Algorithms for molecular biology : AMB}, keywords = {from:davidjamesbryant}, language = {eng}, lr = {20081120}, mhda = {2007/06/29 09:01}, month = Aug, oid = {NLM: PMC1948893}, own = {NLM}, pages = 8, phst = {2007/03/26 {$[$}received{$]$}; 2007/06/28 {$[$}accepted{$]$}; 2007/06/28 {$[$}aheadofprint{$]$}}, pii = {1748-7188-2-8}, pl = {England}, pmc = {PMC1948893}, pmid = {17597551}, pst = {epublish}, pt = {Journal Article}, so = {Algorithms Mol Biol. 2007 Jun 28;2:8.}, stat = {PubMed-not-MEDLINE}, timestamp = {2009-05-14T15:34:03.000+0200}, title = {Consistency of the neighbor-net algorithm.}, url = {http://dx.doi.org/10.1186/1748-7188-2-8}, volume = 2, year = 2007 }