{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:43:54Z","timestamp":1768452234354,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec><jats:title>Background<\/jats:title><jats:p>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.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>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.<\/jats:p><\/jats:sec>","DOI":"10.1186\/1748-7188-2-8","type":"journal-article","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T18:13:09Z","timestamp":1183054389000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Consistency of the Neighbor-Net Algorithm"],"prefix":"10.1186","volume":"2","author":[{"given":"David","family":"Bryant","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Moulton","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Spillner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,28]]},"reference":[{"key":"33_CR1","volume-title":"Inferring phylogenies","author":"J Felsenstein","year":"2003","unstructured":"Felsenstein J: Inferring phylogenies. 2003, Sinauer Associates"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/molbev\/msh018","volume":"21","author":"D Bryant","year":"2004","unstructured":"Bryant D, Moulton V: NeighborNet: An agglomerative method for the construction of phylogenetic networks. Molecular Biology and Evolution. 2004, 21: 255-265. 10.1093\/molbev\/msh018.","journal-title":"Molecular Biology and Evolution"},{"issue":"4","key":"33_CR3","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou N, Nei M: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution. 1987, 4 (4): 406-425.","journal-title":"Molecular Biology and Evolution"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1128\/JVI.01390-06","volume":"81","author":"J Hu","year":"2007","unstructured":"Hu J, Fu HC, Lin CH, Su HJ, Yeh HH: Reassortment and Concerted Evolution in Banana Bunchy Top Virus Genomes. Journal of Virology. 2007, 81: 1746-1761.","journal-title":"Journal of Virology"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1128\/JB.01472-06","volume":"189","author":"D Lacher","year":"2007","unstructured":"Lacher D, Steinsland H, Blank T, Donnenberg M, Whittam T: Sequence Typing and Virulence Gene Allelic Profiling. Journal of Bacteriology. 2007, 189: 342-350.","journal-title":"Journal of Bacteriology"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1093\/molbev\/msl151","volume":"24","author":"B Kilian","year":"2007","unstructured":"Kilian B, Ozkan H, Deusch O, Effgen S, Brandolini A, Kohl J, Martin W, Salamini F: Independent Wheat B and G Genome Origins in Outcrossing Aegilops Progenitor Haplotypes. Molecular Biology Evolution. 2007, 24: 217-227. 10.1093\/molbev\/msl151.","journal-title":"Molecular Biology Evolution"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1098\/rspb.2004.3015","volume":"272","author":"MB Hamed","year":"2005","unstructured":"Hamed MB: Neighbour-nets portray the Chinese dialect continuum and the linguistic legacy of China's demic history. Proc Royal Society B: Biological Sciences. 2005, 272: 1015-1022. 10.1098\/rspb.2004.3015.","journal-title":"Proc Royal Society B: Biological Sciences"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0166-218X(96)00059-5","volume":"71","author":"A Dress","year":"1996","unstructured":"Dress A, Huson D, Moulton V: Analyzing and visualizing sequence and distance data using SplitsTree. Discrete Applied Mathematics. 1996, 71: 95-110. 10.1016\/S0166-218X(96)00059-5.","journal-title":"Discrete Applied Mathematics"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1093\/molbev\/msj030","volume":"23","author":"D Huson","year":"2006","unstructured":"Huson D, Bryant D: Application of Phylogenetic Networks in Evolutionary Studies. Molecular Biology and Evolution. 2006, 23: 254-267. 10.1093\/molbev\/msj030.","journal-title":"Molecular Biology and Evolution"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0001-8708(92)90061-O","volume":"92","author":"HJ Bandelt","year":"1992","unstructured":"Bandelt HJ, Dress A: A canonical split decomposition theory for metrics on a finite set. Advances in Mathematics. 1992, 92: 47-105. 10.1016\/0001-8708(92)90061-O.","journal-title":"Advances in Mathematics"},{"key":"33_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C Semple","year":"2003","unstructured":"Semple C, Steel M: Phylogenetics. 2003, Oxford University Press"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1004907919611","volume":"69","author":"V Chepoi","year":"1998","unstructured":"Chepoi V, Fichet B: A note on circular decomposable metrics. Geometriae Dedicata. 1998, 69: 237-240. 10.1023\/A:1004907919611.","journal-title":"Geometriae Dedicata"},{"key":"33_CR13","first-page":"486","volume-title":"Proc of European Symposium on Algorithms (ESA), Volume 1136 of LNCS, Springer","author":"G Christopher","year":"1996","unstructured":"Christopher G, Farach M, Trick M: The structure of circular decomposable metrics. Proc of European Symposium on Algorithms (ESA), Volume 1136 of LNCS, Springer. 1996, 486-500."},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TCBB.2004.27","volume":"1","author":"A Dress","year":"2004","unstructured":"Dress A, Huson D: Constructing split graphs. IEEE Transactions on Computational Biology and Bioinformatics. 2004, 1 (3): 109-115. 10.1109\/TCBB.2004.27.","journal-title":"IEEE Transactions on Computational Biology and Bioinformatics"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.4153\/CJM-1975-104-6","volume":"27","author":"K Kalmanson","year":"1975","unstructured":"Kalmanson K: Edgeconvex circuits and the travelling salesman problem. Canadian Journal of Mathematics. 1975, 27: 1000-1010.","journal-title":"Canadian Journal of Mathematics"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1093\/molbev\/msl180","volume":"24","author":"S Gr\u00fcnewald","year":"2007","unstructured":"Gr\u00fcnewald S, Forslund K, Dress A, Moulton V: QNet: An agglomerative method for the construction of phylogenetic networks from weighted quartets. Molecular Biology and Evolution. 2007, 24: 532-538. 10.1093\/molbev\/msl180.","journal-title":"Molecular Biology and Evolution"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1128\/JCM.40.5.1626-1635.2002","volume":"40","author":"M Kotetishvili","year":"2002","unstructured":"Kotetishvili M, Stine O, Kreger A, Morris J, Sulakvelidze A: Multilocus sequence typing for characterization of clinical and environmental salmonella strains. Journal of Clinical Microbiology. 2002, 40: 1626-1635.","journal-title":"Journal of Clinical Microbiology"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-2-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T14:47:36Z","timestamp":1708008456000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-2-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,28]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["33"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-2-8","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,28]]},"assertion":[{"value":"26 March 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"8"}}