{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:45:20Z","timestamp":1740109520857,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T00:00:00Z","timestamp":1693785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T00:00:00Z","timestamp":1693785600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Foundation"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Classif"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s00357-023-09447-x","type":"journal-article","created":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T09:02:38Z","timestamp":1693818158000},"page":"513-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Expanding the Class of Global Objective Functions for Dissimilarity-Based Hierarchical Clustering"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7608-8550","authenticated-orcid":false,"given":"Sebastien","family":"Roch","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,4]]},"reference":[{"key":"9447_CR1","unstructured":"Alon, N., Azar, Y., & Vainstein, D. (2020). Hierarchical clustering: A 0.585 revenue approximation. In Proceedings of Thirty Third Conference on Learning Theory, pp. 153\u2013162. PMLR, July 2020. ISSN: 2640-3498"},{"key":"9447_CR2","doi-asserted-by":"crossref","unstructured":"Atteson, K. (1999). The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica, 25(2), 251\u2013278, June 1999","DOI":"10.1007\/PL00008277"},{"key":"9447_CR3","doi-asserted-by":"crossref","unstructured":"Bryant, D. (2005). On the uniqueness of the selection criterion in neighbor-joining. Journal of Classification, 22(1), 3\u201315, June 2005","DOI":"10.1007\/s00357-005-0003-x"},{"key":"9447_CR4","first-page":"6201","volume-title":"Advances in neural information processing systems 30","author":"V Cohen-Addad","year":"2017","unstructured":"Cohen-Addad, V., Kanade, V., & Mallmann-Trenn, F. (2017). Hierarchical clustering beyond the worst-case. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, & R. Garnett (Eds.), Advances in neural information processing systems 30 (pp. 6201\u20136209). Curran Associates Inc."},{"key":"9447_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., & Chatziafratis, V. (2017). Approximate hierarchical clustering via sparsest cut and spreading metrics. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201917, pp. 841\u2013854, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics","DOI":"10.1137\/1.9781611974782.53"},{"key":"9447_CR6","doi-asserted-by":"crossref","unstructured":"Castro, R. M., Coates, M. J., & Nowak R. D. (2004). Likelihood based hierarchical clustering. IEEE Transactions on Signal Processing, 52(8), 2308\u20132321, Aug 2004","DOI":"10.1109\/TSP.2004.831124"},{"key":"9447_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chatziafratis, V., & Niazadeh, R. (2019). Hierarchical clustering better than average-linkage. In Proceedings of the 2019 Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA), Proceedings, pp. 2291\u20132304. Society for Industrial and Applied Mathematics, January 2019","DOI":"10.1137\/1.9781611975482.139"},{"key":"9447_CR8","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Kanade, V., Mallmann-Trenn, F., & Mathieu, C. (2018). Hierarchical clustering: Objective functions and algorithms. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 378\u2013397","DOI":"10.1137\/1.9781611975031.26"},{"key":"9447_CR9","unstructured":"Chatziafratis, V., Niazadeh, R., & Charikar, M. (2018). Hierarchical clustering with structural constraints. In Proceedings of the 35th International Conference on Machine Learning, pp. 774\u2013783. PMLR, July 2018. ISSN: 2640\u20133498"},{"key":"9447_CR10","doi-asserted-by":"crossref","unstructured":"Dasgupta, S. (2016). A cost function for similarity-based hierarchical clustering. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pp. 118\u2013127","DOI":"10.1145\/2897518.2897527"},{"key":"9447_CR11","first-page":"249","volume-title":"Hierarchical cluster methods as maximum likelihood estimators","author":"PO Degens","year":"1983","unstructured":"Degens, P. O. (1983). Hierarchical cluster methods as maximum likelihood estimators (pp. 249\u2013253). Berlin Heidelberg, Berlin, Heidelberg: Springer."},{"key":"9447_CR12","doi-asserted-by":"crossref","unstructured":"Eickmeyer, K., Huggins, P., Pachter, L., & Yoshida, R. (2008). On the optimality of the neighbor-joining algorithm. Algorithms for Molecular Biology, 3(1), 5, April 2008","DOI":"10.1186\/1748-7188-3-5"},{"issue":"1","key":"9447_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.orl.2011.10.003","volume":"40","author":"S Fiorini","year":"2012","unstructured":"Fiorini, S., & Joret, G. (2012). Approximating the balanced minimum evolution problem. Operations Research Letters, 40(1), 31\u201335.","journal-title":"Operations Research Letters"},{"issue":"11","key":"9447_CR14","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1093\/molbev\/msl072","volume":"23","author":"O Gascuel","year":"2006","unstructured":"Gascuel, O., & Steel, M. (2006). Neighbor-joining revealed. Molecular Biology and Evolution, 23(11), 1997\u20132000.","journal-title":"Molecular Biology and Evolution"},{"key":"9447_CR15","unstructured":"Hastie, T., Tibshirani, R., & Friedman, J. (2009). The elements of statistical learning: Data mining, Inference, and Prediction, 2nd Edition, Springer Science & Business Media, August 2009 Google-Books-ID: tVIjmNS3Ob8C"},{"key":"9447_CR16","doi-asserted-by":"crossref","unstructured":"Lacey, M. R., & Chang, J.\u00a0T. (2006). A signal\u2013to\u2013noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences. Mathematical Biosciences, 199(2), 188\u2013215, February 2006","DOI":"10.1016\/j.mbs.2005.11.003"},{"key":"9447_CR17","doi-asserted-by":"crossref","unstructured":"Mihaescu, R., Levy, D., & Pachter, Lior. (2009). Why neighbor-joining works. Algorithmica, 54(1), 1\u201324, May 2009","DOI":"10.1007\/s00453-007-9116-4"},{"key":"9447_CR18","doi-asserted-by":"crossref","unstructured":"Mihaescu, R., & Pachter, L. (2008). Combinatorics of least-squares trees. Proceedings of the National Academy of Sciences, 105(36), 13206\u201313211, September 2008. Publisher: Proceedings of the National Academy of Sciences","DOI":"10.1073\/pnas.0802089105"},{"key":"9447_CR19","unstructured":"Manghiuc, B.-A., & Sun, H. (2021). Hierarchical clustering: O(1)\u2013approximation for well-clustered graphs. In advances in neural information processing systems, volume\u00a034, pp. 9278\u20139289. Curran Associates, Inc"},{"key":"9447_CR20","unstructured":"Murphy, K.\u00a0P. (2012). Machine learning: A probabilistic perspective. MIT Press, September 2012. Google\u2013Books\u2013ID: RC43AgAAQBAJ"},{"key":"9447_CR21","doi-asserted-by":"crossref","unstructured":"Pardi, F., & Gascuel, O. (2012). Combinatorics of distance-based tree inference. Proceedings of the National Academy of Sciences, 109(41), 16443\u201316448, October 2012. Publisher: Proceedings of the national academy of sciences","DOI":"10.1073\/pnas.1118368109"},{"issue":"5971","key":"9447_CR22","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1126\/science.1182300","volume":"327","author":"S Roch","year":"2010","unstructured":"Roch, S. (2010). Toward extracting all phylogenetic information from matrices of evolutionary distances. Science, 327(5971), 1376\u20131379.","journal-title":"Science"},{"key":"9447_CR23","first-page":"2316","volume-title":"Advances in neural information processing systems 29","author":"A Roy","year":"2016","unstructured":"Roy, A., & Pokutta, S. (2016). Hierarchical clustering via spreading metrics. In D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, & R. Garnett (Eds.), Advances in neural information processing systems 29 (pp. 2316\u20132324). Curran Associates Inc."},{"issue":"4","key":"9447_CR24","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou, N., & Nei, M. (1987). The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4(4), 406\u2013425.","journal-title":"Molecular Biology and Evolution"},{"key":"9447_CR25","first-page":"1409","volume":"38","author":"RR Sokal","year":"1958","unstructured":"Sokal, R. R. (1958). A statiscal method for evaluating systematic relationships. Univ Kans sci bull, 38, 1409\u20131438.","journal-title":"Univ Kans sci bull"},{"key":"9447_CR26","doi-asserted-by":"crossref","unstructured":"Semple, C., & Steel, M. (2003). Phylogenetics, volume\u00a022 of mathematics and its applications series. Oxford University Press","DOI":"10.1093\/oso\/9780198509424.001.0001"},{"key":"9447_CR27","unstructured":"Steel, M. (2016). Phylogeny\u2014Discrete and random processes in evolution, volume\u00a089 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA"},{"key":"9447_CR28","doi-asserted-by":"crossref","unstructured":"Warnow, T. (2017). Computational phylogenetics: An introduction to designing methods for phylogeny estimation. Cambridge University Press, USA, 1st edition","DOI":"10.1017\/9781316882313"},{"key":"9447_CR29","doi-asserted-by":"crossref","unstructured":"Willson, S. J. (2005). Minimum evolution using ordinary least-squares is less robust than neighbor-joining. Bulletin of Mathematical Biology, 67(2), 261\u2013279, March 2005","DOI":"10.1016\/j.bulm.2004.07.007"}],"container-title":["Journal of Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-023-09447-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00357-023-09447-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-023-09447-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:03:24Z","timestamp":1702026204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00357-023-09447-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,4]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["9447"],"URL":"https:\/\/doi.org\/10.1007\/s00357-023-09447-x","relation":{},"ISSN":["0176-4268","1432-1343"],"issn-type":[{"type":"print","value":"0176-4268"},{"type":"electronic","value":"1432-1343"}],"subject":[],"published":{"date-parts":[[2023,9,4]]},"assertion":[{"value":"31 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}