{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T07:40:52Z","timestamp":1774770052104,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T00:00:00Z","timestamp":1430870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00453-015-0005-y","type":"journal-article","created":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T12:44:57Z","timestamp":1430829897000},"page":"1386-1403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A \u2018Stochastic Safety Radius\u2019 for Distance-Based Tree Reconstruction"],"prefix":"10.1007","volume":"74","author":[{"given":"Olivier","family":"Gascuel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Steel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,6]]},"reference":[{"issue":"2\u20133","key":"5_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 phylogeny reconstruction. Algorithmica 25(2\u20133), 251\u2013278 (1999)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0304-3975(99)00235-2","volume":"240","author":"V Berry","year":"1997","unstructured":"Berry, V., Gascuel, O.: Inferring evolutionary trees with strong combinatorial evidence. Theor. Comput. Sci. 240(2), 271\u2013298 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bordewich, M., Mihaescu, R.: Accuracy guarantees for phylogeny reconstruction algorithms based on balanced minimum evolution. In: Moulton, V., Singh, M. (eds.) Proceedings of WABI 2010, 10th international workshop on algorithms in bioinformatics, volume 6293 of LNBI, pp. 250\u2013261. Springer (2010)","DOI":"10.1007\/978-3-642-15294-8_21"},{"key":"5_CR4","first-page":"868","volume":"8","author":"M Bulmer","year":"1991","unstructured":"Bulmer, M.: Use of the method of generalized least-squares in reconstructing phylogenies from sequence data. Mol. Biol. Evol. 8, 868\u2013883 (1991)","journal-title":"Mol. Biol. Evol."},{"key":"5_CR5","volume-title":"Statistical Inference","author":"G Casella","year":"1990","unstructured":"Casella, G., Berger, R.L.: Statistical Inference. Duxbury Press, Belmont (1990)"},{"key":"5_CR6","first-page":"223","volume":"19","author":"LL Cavalli-Sforza","year":"1967","unstructured":"Cavalli-Sforza, L.L., Edwards, A.W.F.: Phylogenetic analysis: models and estimation procedures. Am. J. Hum. Genet. 19, 223\u2013257 (1967)","journal-title":"Am. J. Hum. Genet."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1089\/106652702761034136","volume":"9","author":"R Desper","year":"2002","unstructured":"Desper, R., Gascuel, O.: Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. J. Comput. Biol. 9, 687\u2013706 (2002)","journal-title":"J. Comput. Biol."},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/1748-7188-3-5","volume":"3","author":"K Eickmeyer","year":"2008","unstructured":"Eickmeyer, K., Huggins, P., Pachter, L., Yoshida, R.: On the optimality of the neighbor-joining algorithm. Algorithms Mol. Biol. 3, 5 (2008)","journal-title":"Algorithms Mol. Biol."},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1126\/science.155.3760.279","volume":"155","author":"WM Fitch","year":"1967","unstructured":"Fitch, W.M., Margoliash, E.: Construction of phylogenetic trees. Science 155, 279\u2013284 (1967)","journal-title":"Science"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1090\/dimacs\/037\/09","volume-title":"Mathematical Hierarchies and Biology","author":"O Gascuel","year":"1997","unstructured":"Gascuel, O.: Concerning the NJ algorithm and its unweighted version, UNJ. In: Mirkin, B., McMorris, F.R., Roberts, F.S., Rzhetsky, A. (eds.) Mathematical Hierarchies and Biology, pp. 149\u2013170. American Mathematical Society, Providence (1997)"},{"issue":"7","key":"5_CR11","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1093\/oxfordjournals.molbev.a025808","volume":"14","author":"O Gascuel","year":"1997","unstructured":"Gascuel, O.: \u201dBIONJ: 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."},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s003570000005","volume":"17","author":"O Gascuel","year":"2000","unstructured":"Gascuel, O.: Data model and classification by trees: the minimum variance reduction (MVR) method. J. Classif. 17, 69\u201399 (2000)","journal-title":"J. Classif."},{"issue":"3","key":"5_CR13","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1093\/oxfordjournals.molbev.a026319","volume":"17","author":"O Gascuel","year":"2000","unstructured":"Gascuel, O.: On the optimization principle in phylogenetic analysis and the minimum evolution criterion. Mol. Biol. Evol. 17(3), 401\u2013405 (2000)","journal-title":"Mol. Biol. Evol."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00357-004-0003-2","volume":"21","author":"O Gascuel","year":"2004","unstructured":"Gascuel, O., McKenzie, A.: Performance analysis of hierarchical clustering algorithms. J. Classif. 21, 3\u201318 (2004)","journal-title":"J. Classif."},{"issue":"11","key":"5_CR15","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."},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01202585","volume":"13","author":"O Gascuel","year":"1996","unstructured":"Gascuel, O., Levy, D.: A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance. J. Classif. 13, 129\u2013155 (1996)","journal-title":"J. Classif."},{"key":"5_CR17","volume-title":"Information Theory with Applications","author":"S Guiasu","year":"1977","unstructured":"Guiasu, S.: Information Theory with Applications. McGraw-Hill, New York (1977)"},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/jagm.1996.0035","volume":"21","author":"SK Kannan","year":"1996","unstructured":"Kannan, S.K., Lawler, E.L., Warnow, T.J.: Determining the evolutionary tree using experiments. J. Algorithms 21, 26\u201350 (1996)","journal-title":"J. Algorithms"},{"issue":"1","key":"5_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-007-9116-4","volume":"54","author":"R Mihaescu","year":"2009","unstructured":"Mihaescu, R., Levy, D., Pachter, L.: Why neighbor-joining works. Algorithmica 54(1), 1\u201324 (2009)","journal-title":"Algorithmica"},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"1820","DOI":"10.1007\/s11538-010-9510-y","volume":"72","author":"F Pardi","year":"2010","unstructured":"Pardi, F., Guillemot, S., Gascuel, O.: Robustness of phylogenetic inference based on minimum evolution. Bull. Math. Biol. 72, 1820\u20131839 (2010)","journal-title":"Bull. Math. Biol."},{"key":"5_CR21","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/0885-064X(86)90023-3","volume":"2","author":"J Pearl","year":"1986","unstructured":"Pearl, J., Tarsi, M.: Structuring causal trees. J. Complex. 2, 60\u201377 (1986)","journal-title":"J. Complex."},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s002390010065","volume":"51","author":"Y Pauplin","year":"2000","unstructured":"Pauplin, Y.: Direct calculation of a tree length using a distance matrix. J. Mol. Evol. 51, 41\u201347 (2000)","journal-title":"J. Mol. Evol."},{"key":"5_CR23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"DR Robinson","year":"1981","unstructured":"Robinson, D.R., Foulds, L.R.: Comparison of phylogenetic trees. Math. Biosci. 53, 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"key":"5_CR24","first-page":"1073","volume":"10","author":"A Rzhetsky","year":"1993","unstructured":"Rzhetsky, A., Nei, M.: Theoretical foundation of the minimum-evolution method of phylogenetic inference. Mol. Biol. Evol. 10, 1073\u20131095 (1993)","journal-title":"Mol. Biol. Evol."},{"key":"5_CR25","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, 406\u2013425 (1987)","journal-title":"Mol. Biol. Evol."},{"key":"5_CR26","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02293654","volume":"42","author":"S Sattath","year":"1997","unstructured":"Sattath, S., Tversky, A.: Additive similarity trees. Psychometrika 42, 319\u2013345 (1997)","journal-title":"Psychometrika"},{"key":"5_CR27","first-page":"90","volume":"20","author":"K Zarestkii","year":"1965","unstructured":"Zarestkii, K.: Reconstructing a tree from the distances between its leaves (In Russian). Uspehi Mathematicheskikh Nauk 20, 90\u201392 (1965)","journal-title":"Uspehi Mathematicheskikh Nauk"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0005-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0005-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0005-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:21Z","timestamp":1559087241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0005-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,6]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["5"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0005-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,6]]}}}