{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T10:21:22Z","timestamp":1783851682952,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642184710","type":"print"},{"value":"9783642184727","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18472-7_26","type":"book-chapter","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T22:57:30Z","timestamp":1299020250000},"page":"334-344","source":"Crossref","is-referenced-by-count":21,"title":["Inference of Large Phylogenies Using Neighbour-Joining"],"prefix":"10.1007","author":[{"given":"Martin","family":"Simonsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Mailund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian N. S.","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"9","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggerwal","year":"1988","unstructured":"Aggerwal, A., Vitter, T.S.: The input output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"issue":"7","key":"26_CR2","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1101\/gr.3844805","volume":"15","author":"E.J. Alm","year":"2005","unstructured":"Alm, E.J., Huang, K.H., Price, M.N., Koche, R.P., Keller, K., Dubchak, I.L., Arkin, A.P.: The microbesonline web site for comparative genomics. Genome Research\u00a015(7), 1015\u20131022 (2005)","journal-title":"Genome Research"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1007\/11523468_102","volume-title":"Automata, Languages and Programming","author":"I. Elias","year":"2005","unstructured":"Elias, I., Lagergren, J.: Fast neighbor joining. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1263\u20131274. Springer, Heidelberg (2005)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1093\/nar\/gkj149","volume":"Database Issue","author":"R.D. Finn","year":"2006","unstructured":"Finn, R.D., Mistry, J., Schuster-B\u00f6ckler, B., Griffiths-Jones, S., Hollich, V., Lassmann, T., Moxon, S., Marshall, M., Khanna, A., Durbin, R., Eddy, S.R., Sonnhammer, E.L.L., Bateman, A.: Pfam: clans, web tools and services. Nucleic Acids Research\u00a0Database Issue 34, D247\u2013D251 (2006)","journal-title":"Nucleic Acids Research"},{"issue":"11","key":"26_CR5","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1093\/bioinformatics\/18.11.1546","volume":"18","author":"K. Howe","year":"2002","unstructured":"Howe, K., Bateman, A., Durbin, R.: QuickTree: Building huge neighbour-joining trees of protein sequences. Bioinformatics\u00a018(11), 1546\u20131547 (2002)","journal-title":"Bioinformatics"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Mailund, T., Brodal, G.S., Fagerberg, R., Pedersen, C.N.S., Philips, D.: Recrafting the neighbor-joining method. BMC Bioinformatics\u00a07(29) (2006)","DOI":"10.1186\/1471-2105-7-29"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1093\/bioinformatics\/bth359","volume":"20","author":"T. Mailund","year":"2004","unstructured":"Mailund, T., Pedersen, C.N.S.: QuickJoin \u2013 fast neighbour-joining tree reconstruction. Bioinformatics\u00a020, 3261\u20133262 (2004)","journal-title":"Bioinformatics"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Ott, M., Zola, J., Stamatakis, A., Aluru, S.: Large-scale maximum likelihood-based phylogenetic analysis on the ibm bluegene\/l. In: Proceedings of the 2007 ACM\/IEEE Conference on Supercomputing, pp. 1\u201311 (2007)","DOI":"10.1145\/1362622.1362628"},{"issue":"7","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1093\/molbev\/msp077","volume":"26","author":"M.N. Price","year":"2009","unstructured":"Price, M.N., Dehal, P.S., Arkin, A.P.: Fasttree: Computing large minimum-evolution trees with profiles instead of a distance matrix. Mol. Biol. Evol.\u00a026(7), 1641\u20131650 (2009)","journal-title":"Mol. Biol. Evol."},{"key":"26_CR10","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. Molecular Biology and Evolution\u00a04, 406\u2013425 (1987)","journal-title":"Molecular Biology and Evolution"},{"issue":"22","key":"26_CR11","doi-asserted-by":"publisher","first-page":"2823","DOI":"10.1093\/bioinformatics\/btl478","volume":"22","author":"L. Sheneman","year":"2006","unstructured":"Sheneman, L., Evans, J., Foster, J.A.: Clearcut: A fast implementation of relaxed neighbor-joining. Bioinformatics\u00a022(22), 2823\u20132824 (2006)","journal-title":"Bioinformatics"},{"key":"26_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-87361-7_10","volume-title":"Algorithms in Bioinformatics","author":"M. Simonsen","year":"2008","unstructured":"Simonsen, M., Mailund, T., Pedersen, C.N.S.: Rapid neighbour-joining. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 113\u2013122. Springer, Heidelberg (2008)"},{"issue":"21","key":"26_CR13","first-page":"2688","volume":"22","author":"A. Stamatakis","year":"2006","unstructured":"Stamatakis, A.: Raxml-vi-hpc: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Oxford Journals\u00a022(21), 2688\u20132690 (2006)","journal-title":"Oxford Journals"},{"key":"26_CR14","first-page":"729","volume":"5","author":"J.A. Studier","year":"1988","unstructured":"Studier, J.A., Kepler, K.J.: A note on the neighbour-joining method of Saitou and Nei. Molecular Biology and Evolution\u00a05, 729\u2013731 (1988)","journal-title":"Molecular Biology and Evolution"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-04241-6_31","volume-title":"Algorithms in Bioinformatics","author":"T.J. Wheeler","year":"2009","unstructured":"Wheeler, T.J.: Large-scale neighbor-joining with ninja. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol.\u00a05724, pp. 375\u2013389. Springer, Heidelberg (2009)"}],"container-title":["Communications in Computer and Information Science","Biomedical Engineering Systems and Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18472-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:03:26Z","timestamp":1606187006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18472-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184710","9783642184727"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18472-7_26","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}