{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:07:42Z","timestamp":1794380862171,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642152931","type":"print"},{"value":"9783642152948","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15294-8_21","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T04:51:46Z","timestamp":1284094306000},"page":"250-261","source":"Crossref","is-referenced-by-count":2,"title":["Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution"],"prefix":"10.1007","author":[{"given":"Magnus","family":"Bordewich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Radu","family":"Mihaescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/PL00008277","volume":"25","author":"K. Atteson","year":"1999","unstructured":"Atteson, K.: The performance of the neighbor-joining methods of phylogenetic reconstruction. Algorithmica\u00a025, 251\u2013278 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TCBB.2008.37","volume":"6","author":"M. Bordewich","year":"2009","unstructured":"Bordewich, M., Gascuel, O., Huber, K., Moulton, V.: Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a06(1), 110\u2013117 (2009)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"21_CR3","doi-asserted-by":"publisher","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.\u00a017, 189\u2013197 (2000)","journal-title":"Mol. Biol. Evol."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Desper, R., Gascuel, O.: Fast and accurate phylogeny reconstruction algorithms based on the minimum evolution principle. J. Comp. Biol.\u00a09, 587\u2013598 (2002), Latest software available at, http:\/\/atgc.lirmm.fr\/fastme\/","DOI":"10.1089\/106652702761034136"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1093\/molbev\/msh049","volume":"21","author":"R. Desper","year":"2004","unstructured":"Desper, R., Gascuel, O.: Theoretical foundation of the balanced minimum evolution method of phylogenetic inference and its relationship to weighted least-squares tree fitting. Mol. Biol. Evol.\u00a021, 587\u2013598 (2004)","journal-title":"Mol. Biol. Evol."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1093\/sysbio\/46.1.101","volume":"46","author":"J. Felsenstein","year":"1997","unstructured":"Felsenstein, J.: An alternating least-squares approach to inferring phylogenies from pairwise distances. Syst. Biol.\u00a046, 101\u2013111 (1997)","journal-title":"Syst. Biol."},{"key":"21_CR7","doi-asserted-by":"publisher","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.\u00a014, 685\u2013695 (1997)","journal-title":"Mol. Biol. Evol."},{"issue":"11","key":"21_CR8","doi-asserted-by":"publisher","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.\u00a023(11), 1997\u20132000 (2006)","journal-title":"Mol. Biol. Evol."},{"issue":"24","key":"21_CR9","doi-asserted-by":"publisher","first-page":"4338","DOI":"10.1093\/bioinformatics\/bti713","volume":"21","author":"W. Hordijk","year":"2005","unstructured":"Hordijk, W., Gascuel, O.: Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood. Bioinformatics\u00a021(24), 4338\u20134347 (2005)","journal-title":"Bioinformatics"},{"key":"21_CR10","unstructured":"Mihaescu, R.: Reliability results for the general Balanced Minimum Evolution principle (in preparation)"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","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\u00a054(1), 1\u201324 (2009)","journal-title":"Algorithmica"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Pardi, F., Guillemot, S., Gascuel, O.: Robustness of phylogenetic inference based on minimum evolution. Bulletin of Mathematical Biology (2010) (in press)","DOI":"10.1007\/s11538-010-9510-y"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"66","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.\u00a051, 66\u201385 (2000)","journal-title":"J. Mol. Evol."},{"key":"21_CR14","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.\u00a04, 406\u2013424 (1987)","journal-title":"Mol. Biol. Evol."},{"key":"21_CR15","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. Oxford University Press, Oxford (2003)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Shigezumi, T.: Robustness of greedy type minimum evolution algorithms. In: Computational Science \u2013ICCS 2006, pp. 815\u2013821 (2006)","DOI":"10.1007\/11758525_109"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15294-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T12:49:51Z","timestamp":1740487791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_21","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}