{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:25:32Z","timestamp":1725575132810},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343813"},{"type":"electronic","value":"9783540343820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758525_109","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T15:03:32Z","timestamp":1147359812000},"page":"815-821","source":"Crossref","is-referenced-by-count":3,"title":["Robustness of Greedy Type Minimum Evolution Algorithms"],"prefix":"10.1007","author":[{"given":"Takeya","family":"Shigezumi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"109_CR1","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. J. of Mol. Biol. Evol.\u00a021(3), 587\u2013598 (2004)","journal-title":"J. of Mol. Biol. Evol."},{"key":"109_CR2","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1089\/106652702761034136","volume":"9","author":"R. Desper","year":"2002","unstructured":"Desper, R., Gascuel, R.: Fast and accurate phylogeny reconstruction algorithms based on the minimum evolution principle. J. Comp. Biol.\u00a09, 687\u2013705 (2002)","journal-title":"J. Comp. Biol."},{"issue":"1","key":"109_CR3","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.\u00a051(1), 41\u201347 (2000)","journal-title":"J. Mol. Evol."},{"issue":"4","key":"109_CR4","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(4), 406\u2013425 (1987)","journal-title":"Mol. Biol. Evol."},{"issue":"7","key":"109_CR5","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.\u00a014(7), 685\u2013695 (1997)","journal-title":"Mol. Biol. Evol."},{"issue":"1","key":"109_CR6","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.: Weighted Neighbor Joining: a Likelihood-Based Approach to Distance-Based Phylogeny Reconstruction. Mol. Biol. Evol.\u00a017(1), 189\u2013197 (2000)","journal-title":"Mol. Biol. Evol."},{"key":"109_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BFb0045077","volume-title":"Computing and Combinatorics","author":"K. Atteson","year":"1997","unstructured":"Atteson, K.: The Performance of Neighbor-Joining Algorithms of Phylogeny Reconstruction. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol.\u00a01276, pp. 101\u2013110. Springer, Heidelberg (1997)"},{"issue":"2","key":"109_CR8","doi-asserted-by":"publisher","first-page":"224","DOI":"10.2307\/2413432","volume":"35","author":"W. Day","year":"1986","unstructured":"Day, W., Sankoff, D.: Computational Complexity of Inferring Phylogenies by Compatibility. Systematic Zoology\u00a035(2), 224\u2013229 (1986)","journal-title":"Systematic Zoology"},{"issue":"1","key":"109_CR9","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. Systematic Biology\u00a046(1), 101\u2013111 (1997)","journal-title":"Systematic Biology"},{"key":"109_CR10","doi-asserted-by":"crossref","unstructured":"Benedetto, D., Caglioti, E., Loreto, V.: Language Trees and Zipping. Physical Review Letters\u00a088(4), 048702-1\u201304872-4 (2002)","DOI":"10.1103\/PhysRevLett.88.048702"},{"issue":"4","key":"109_CR11","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R. Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.: Clustering by Compression. IEEE Transactions on Information Theory\u00a051(4), 1523\u20131545 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"109_CR12","unstructured":"Shigezumi, T.: Robustness of Greedy Type Minimum Evolution Algorithms. Dept. of Math. and Comp. Sciences Tokyo Institute of Technology Research Reports (Series C), C-218 (2005), http:\/\/www.is.titech.ac.jp\/research\/research-report\/C\/C-218.ps.gz"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758525_109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T19:42:44Z","timestamp":1555616564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758525_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343813","9783540343820"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11758525_109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}