{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T13:45:57Z","timestamp":1790775957535,"version":"4.1.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,4]],"date-time":"2007-12-04T00:00:00Z","timestamp":1196726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s00453-007-9116-4","type":"journal-article","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T18:50:53Z","timestamp":1196707853000},"page":"1-24","source":"Crossref","is-referenced-by-count":85,"title":["Why Neighbor-Joining Works"],"prefix":"10.1007","volume":"54","author":[{"given":"Radu","family":"Mihaescu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Levy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lior","family":"Pachter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,12,4]]},"reference":[{"key":"9116_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/PL00008277","volume":"25","author":"K. Atteson","year":"1999","unstructured":"Atteson, K.: The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica 25, 251\u2013278 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"9116_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1093\/oxfordjournals.molbev.a026231","volume":"17","author":"W.J. Bruno","year":"2000","unstructured":"Bruno, W.J., Socci, N.D., Halpern, A.L.: Weighted neighbor-joining: a likelihood-based approach to distance-based phylogeny reconstruction. Mol. Biol. Evol. 17(1), 189\u2013197 (2000)","journal-title":"Mol. Biol. Evol."},{"issue":"1","key":"9116_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00357-005-0003-x","volume":"22","author":"D. Bryant","year":"2005","unstructured":"Bryant, D.: On the uniqueness of the selection criterion in neighbor-joining. J. Classif. 22(1), 3\u201315 (2005)","journal-title":"J. Classif."},{"issue":"1\u20133","key":"9116_CR4","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.tcs.2006.08.044","volume":"369","author":"W. Dai","year":"2006","unstructured":"Dai, W., Xu, Y., Zhu, B.: On the edge l \u221e radius of Saitou and Nei\u2019s method for phylogenetic reconstruction. Theor. Comput. Sci. 369(1\u20133), 448\u2013455 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9116_CR5","volume-title":"Mathematics of Evolution and Phylogeny","author":"R. Desper","year":"2005","unstructured":"Desper, R., Gascuel, O.: The minimum evolution distance-based approach to phylogenetic inference. In: Gascuel, O. (ed.) Mathematics of Evolution and Phylogeny. Oxford University Press, Oxford (2005)"},{"key":"9116_CR6","doi-asserted-by":"crossref","unstructured":"Elias, I., Lagergren, J.: Fast neighbor joining. In: Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP\u201905) (2005)","DOI":"10.1007\/11523468_102"},{"issue":"2","key":"9116_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R","volume":"14","author":"P.L. Erd\u00f6s","year":"1999","unstructured":"Erd\u00f6s, P.L., Steel, M.A., Sz\u00e9kely, L.A., Warnow, T.J.: A few logs suffice to build (almost) all trees, I. Random Struct. Algorithms 14(2), 153\u2013184 (1999)","journal-title":"Random Struct. Algorithms"},{"key":"9116_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1111\/j.1096-0031.1996.tb00196.x","volume":"12","author":"J.S. Farris","year":"1996","unstructured":"Farris, J.S., Albert, V.A., K\u00e4llersj\u00f6, M., Lipscomb, D., Kluge, A.G.: Parsimony jackknifing outperforms neighbor-joining. Cladistics 12, 99\u2013124 (1996)","journal-title":"Cladistics"},{"key":"9116_CR9","unstructured":"Felsenstein, J.: PHYLIP (phylogeny inference package) version 3.5c. Tech. report, Department of Genetics, University of Washington, Seattle (1993)"},{"issue":"6","key":"9116_CR10","first-page":"961","volume":"11","author":"O. Gascuel","year":"1994","unstructured":"Gascuel, O.: A note on Sattath and Tversky\u2019s, Saitou and Nei\u2019s, and Studier and Keppler\u2019s algorithms for inferring phylogenies from evolutionary distances. Mol. Biol. Evol. 11(6), 961\u2013963 (1994)","journal-title":"Mol. Biol. Evol."},{"issue":"7","key":"9116_CR11","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1093\/oxfordjournals.molbev.a025808","volume":"14","author":"O. Gascuel","year":"1997","unstructured":"Gascuel, O.: BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol. 14(7), 685\u2013695 (1997)","journal-title":"Mol. Biol. Evol."},{"issue":"11","key":"9116_CR12","doi-asserted-by":"crossref","first-page":"1997","DOI":"10.1093\/molbev\/msl072","volume":"23","author":"O. Gascuel","year":"2006","unstructured":"Gascuel, O., Steel, M.: Neighbor-joining revealed. Mol. Biol. Evol. 23(11), 1997\u20132000 (2006)","journal-title":"Mol. Biol. Evol."},{"issue":"3","key":"9116_CR13","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1093\/molbev\/msi066","volume":"22","author":"B.G. Hall","year":"2005","unstructured":"Hall, B.G.: Comparison of the accuracies of several phylogenetic methods using protein and DNA sequences. Mol. Biol. Evol. 22(3), 792\u2013802 (2005)","journal-title":"Mol. Biol. Evol."},{"issue":"3","key":"9116_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1093\/sysbio\/42.3.247","volume":"42","author":"J. Huelsenbeck","year":"1993","unstructured":"Huelsenbeck, J., Hillis, D.: Success of phylogenetic methods in the four-taxon case. Syst. Biol. 42(3), 247\u2013264 (1993)","journal-title":"Syst. Biol."},{"key":"9116_CR15","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/S0196-6774(03)00049-X","volume":"48","author":"K.St. John","year":"2003","unstructured":"John, K.St., Warnow, T., Moret, B., Vawter, L.: Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor joining. J. Algorithms 48, 174\u2013193 (2003)","journal-title":"J. Algorithms"},{"key":"9116_CR16","first-page":"459","volume":"11","author":"M.K. Kuhner","year":"1994","unstructured":"Kuhner, M.K., Felsenstein, J.: A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Mol. Biol. Evol. 11, 459\u2013468 (1994)","journal-title":"Mol. Biol. Evol."},{"key":"9116_CR17","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/s002390010118","volume":"51","author":"S. Kumar","year":"2000","unstructured":"Kumar, S., Gadagker, S.R.: Efficiency of the neighbor-joining method in reconstructing evolutionary relationships in large phylogenies. J. Mol. Evol. 51, 544\u2013553 (2000)","journal-title":"J. Mol. Evol."},{"key":"9116_CR18","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1093\/molbev\/msj059","volume":"23","author":"D. Levy","year":"2006","unstructured":"Levy, D., Yoshida, R., Pachter, L.: Beyond pairwise distances: neighbor joining with phylogenetic diversity estimates. Mol. Biol. Evol. 23, 491\u2013498 (2006)","journal-title":"Mol. Biol. Evol."},{"key":"9116_CR19","first-page":"41","volume":"10","author":"G.J. Olsen","year":"1994","unstructured":"Olsen, G.J., Matsuda, H., Hagstrom, R., Overbeek, R.: fastDNAml: a tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Comput. Appl. Biosci. 10, 41\u201348 (1994)","journal-title":"Comput. Appl. Biosci."},{"issue":"9","key":"9116_CR20","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1093\/oxfordjournals.molbev.a026423","volume":"17","author":"S. Ota","year":"2000","unstructured":"Ota, S., Li, W.H.: NJML: a hybrid algorithm for the neighbor-joining and maximum likelihood methods. Mol. Biol. Evol. 17(9), 1401\u20131409 (2000)","journal-title":"Mol. Biol. Evol."},{"key":"9116_CR21","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s002390010065","volume":"51","author":"Y. Pauplin","year":"2000","unstructured":"Pauplin, Y.: Direct calculation of tree length using a distance matrix. J. Mol. Evol. 51, 41\u201347 (2000)","journal-title":"J. Mol. Evol."},{"key":"9116_CR22","first-page":"235","volume":"13","author":"A. Rambaut","year":"1997","unstructured":"Rambaut, A., Grassly, N.C.: Seq-Gen: an application for the Monte Carlo simulation of DNA sequences evolution along phylogenetic trees. Comput. Appl. Biosci. 13, 235\u2013238 (1997)","journal-title":"Comput. Appl. Biosci."},{"issue":"11","key":"9116_CR23","doi-asserted-by":"crossref","first-page":"1952","DOI":"10.1093\/oxfordjournals.molbev.a004019","volume":"19","author":"V. Ranwez","year":"2002","unstructured":"Ranwez, V., Gascuel, O.: Improvement of distance-based phylogenetic methods by a local maximum likelihood approach using triplets. Mol. Biol. Evol. 19(11), 1952\u20131963 (2002)","journal-title":"Mol. Biol. Evol."},{"issue":"4","key":"9116_CR24","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. Mol. Biol. Evol. 4(4), 406\u2013425 (1987)","journal-title":"Mol. Biol. Evol."},{"issue":"6","key":"9116_CR25","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02293654","volume":"42","author":"S. Sattath","year":"1977","unstructured":"Sattath, S., Tversky, A.: Additive similarity trees. Psychometrika 42(6), 319\u2013345 (1977)","journal-title":"Psychometrika"},{"key":"9116_CR26","series-title":"Graduate Series in Mathematics and its Applications","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. Graduate Series in Mathematics and its Applications. Oxford University Press, Oxford (2003)"},{"key":"9116_CR27","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","volume":"13","author":"K. Strimmer","year":"1996","unstructured":"Strimmer, K., von Haeseler, A.: Quartet puzzling: a quartet maximum likelihood method for reconstructing tree topologies. Mol. Biol. Evol. 13, 964\u2013969 (1996)","journal-title":"Mol. Biol. Evol."},{"key":"9116_CR28","first-page":"729","volume":"5","author":"J.A. Studier","year":"1988","unstructured":"Studier, J.A., Keppler, K.J.: A note on the neighbor-joining method of Saitou and Nei. Mol. Biol. Evol. 5, 729\u2013731 (1988)","journal-title":"Mol. Biol. Evol."},{"key":"9116_CR29","doi-asserted-by":"crossref","first-page":"11030","DOI":"10.1073\/pnas.0404206101","volume":"101","author":"K. Tamura","year":"2004","unstructured":"Tamura, K., Nei, M., Kumar, S.: Prospects for inferring very large phylogenies by using the neighbor-joining method. Proc. Natl. Acad. Sci. 101, 11030\u201311035 (2004)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"9116_CR30","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.ipl.2005.02.006","volume":"94","author":"Y. Xu","year":"2005","unstructured":"Xu, Y., Dai, W., Zhu, B.: A lower bound on the edge l \u221e radius of Saitou and Nei\u2019s method for phylogenetic reconstruction. Inf. Process. Lett. 94, 225\u2013230 (2005)","journal-title":"Inf. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9116-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9116-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9116-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T19:28:57Z","timestamp":1708370937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9116-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,4]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["9116"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9116-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,4]]}}}