{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:18:16Z","timestamp":1725603496428},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642230370"},{"type":"electronic","value":"9783642230387"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23038-7_2","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:06:43Z","timestamp":1314695203000},"page":"14-25","source":"Crossref","is-referenced-by-count":4,"title":["Towards a Practical O(n logn) Phylogeny Algorithm"],"prefix":"10.1007","author":[{"given":"Daniel G.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Truszkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00453-003-1065-y","volume":"38","author":"G.S. Brodal","year":"2003","unstructured":"Brodal, G.S., Fagerberg, R., Pedersen, C.N.S.: Computing the quartet distance between evolutionary trees in time O(n log n). Algorithmica\u00a038(2), 377\u2013395 (2003)","journal-title":"Algorithmica"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-21458-5_14","volume-title":"Combinatorial Pattern Matching","author":"D.G. Brown","year":"2011","unstructured":"Brown, D.G., Truszkowski, J.: Fast error-tolerant quartet phylogeny algorithms. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 147\u2013161. Springer, Heidelberg (2011)"},{"key":"2_CR3","unstructured":"Bryant, D., Tsang, J., Kearney, P.E., Li, M.: Computing the quartet distance between evolutionary trees. In: Proceedings of SODA 2000, pp. 285\u2013286 (2000)"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1089\/10665270252935467","volume":"9","author":"M. Cs\u0171r\u00f6s","year":"2002","unstructured":"Cs\u0171r\u00f6s, M.: Fast recovery of evolutionary trees with thousands of nodes. J. Comp. Biol.\u00a09(2), 277\u2013297 (2002)","journal-title":"J. Comp. Biol."},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-02008-7_32","volume-title":"Research in Computational Molecular Biology","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Mossel, E., Roch, S.: Phylogenies without branch bounds: Contracting the short, pruning the deep. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 451\u2013465. Springer, Heidelberg (2009)"},{"issue":"5","key":"2_CR6","doi-asserted-by":"publisher","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. Comp. Biol.\u00a09(5), 687\u2013706 (2002)","journal-title":"J. Comp. Biol."},{"key":"2_CR7","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)"},{"issue":"1-2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0304-3975(99)00028-6","volume":"221","author":"P.L. Erd\u00f6s","year":"1999","unstructured":"Erd\u00f6s, P.L., Steel, M.A., Sz\u00e9kely, L.A., Warnow, T.: A few logs suffice to build (almost) all trees: Part II. Theor. Comput. Sci.\u00a0221(1-2), 77\u2013118 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ipl.2007.07.002","volume":"104","author":"I. Gronau","year":"2007","unstructured":"Gronau, I., Moran, S.: Optimal implementations of UPGMA and other common clustering algorithms. Inf. Process. Lett.\u00a0104(6), 205\u2013210 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jagm.1996.0035","volume":"21","author":"S.K. Kannan","year":"1996","unstructured":"Kannan, S.K., Lawler, E.L., Warnow, T.J.: Determining the evolutionary tree using experiments. J. Algorithms\u00a021(1), 26\u201350 (1996)","journal-title":"J. Algorithms"},{"key":"2_CR11","unstructured":"Karp, R.M., Kleinberg, R.: Noisy binary search and its applications. In: Proceedings of SODA 2007, pp. 881\u2013890 (2007)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kearney, P.E.: The ordinal quartet method. In: Proceedings of RECOMB 1998, pp. 125\u2013134 (1998)","DOI":"10.1145\/279069.279105"},{"key":"2_CR13","unstructured":"King, V., Zhang, L., Zhou, Y.: On the complexity of distance-based evolutionary tree reconstruction. In: Proceedings of SODA 2003, pp. 444\u2013453 (2003)"},{"issue":"7","key":"2_CR14","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."},{"issue":"6","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1093\/oxfordjournals.molbev.a003881","volume":"18","author":"V. Ranwez","year":"2001","unstructured":"Ranwez, V., Gascuel, O.: Quartet-based phylogenetic inference: Improvements and limits. Mol. Biol. Evol.\u00a018(6), 1103\u20131116 (2001)","journal-title":"Mol. Biol. Evol."},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1089\/cmb.2007.0103","volume":"15","author":"S. Snir","year":"2008","unstructured":"Snir, S., Warnow, T., Rao, S.: Short quartet puzzling: A new quartet-based phylogeny reconstruction algorithm. J. Comp. Biol.\u00a015(1), 91\u2013103 (2008)","journal-title":"J. Comp. Biol."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1186\/1471-2105-6-108","volume":"6","author":"E.L.L. Sonnhammer","year":"2005","unstructured":"Sonnhammer, E.L.L., Hollich, V.: Scoredist: A simple and robust protein sequence distance estimator. BMC Bioinf.\u00a06, 108 (2005)","journal-title":"BMC Bioinf."},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1093\/oxfordjournals.molbev.a025756","volume":"14","author":"K. Strimmer","year":"1996","unstructured":"Strimmer, K., Goldman, N., von Haeseler, A.: Bayesian probabilities and quartet puzzling. Mol. Biol. Evol.\u00a014(2), 210\u2013211 (1996)","journal-title":"Mol. Biol. Evol."},{"issue":"7","key":"2_CR19","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","volume":"13","author":"K. Strimmer","year":"1996","unstructured":"Strimmer, K., von Haeseler, A.: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Mol. Biol. Evol.\u00a013(7), 964\u2013969 (1996)","journal-title":"Mol. Biol. Evol."},{"key":"2_CR20","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":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23038-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T11:50:40Z","timestamp":1554119440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23038-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642230370","9783642230387"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23038-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}