{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:03:41Z","timestamp":1725455021343},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331213"},{"type":"electronic","value":"9783642331220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_2","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T10:43:09Z","timestamp":1346150589000},"page":"14-29","source":"Crossref","is-referenced-by-count":5,"title":["Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing"],"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":[{"key":"2_CR1","series-title":"LNCS (LNBI)","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-23038-7_2","volume-title":"Algorithms in Bioinformatics","author":"D.G. Brown","year":"2011","unstructured":"Brown, D.G., Truszkowski, J.: Towards a Practical O(n logn) Phylogeny Algorithm. In: Przytycka, T.M., Sagot, M.-F. (eds.) WABI 2011. LNCS (LNBI), vol.\u00a06833, pp. 14\u201325. Springer, Heidelberg (2011)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Brown, D.G., Truszkowski, J.: Towards a practical O(n logn) phylogeny algorithm. Algorithms for Molecular Biology (special issue on selected papers from WABI 2011 (submitted, 2012)","DOI":"10.1186\/1748-7188-7-32"},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J. Buhler","year":"2002","unstructured":"Buhler, J., Tompa, M.: Finding motifs using random projections. J. Comp. Biol.\u00a09(2), 225\u2013242 (2002)","journal-title":"J. Comp. Biol."},{"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)"},{"key":"2_CR6","unstructured":"Daskalakis, C., Mossel, E., Roch, S.: Evolutionary trees and the Ising model on the Bethe lattice: a proof of Steel\u2019s conjecture (July 27, 2005), \n                  \n                    http:\/\/arxiv.org\/abs\/math\/0509575"},{"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"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"5069","DOI":"10.1128\/AEM.03006-05","volume":"72","author":"P.L. Erd\u00f6s","year":"2006","unstructured":"Erd\u00f6s, P.L., Steel, M.A., Sz\u00e9kely, L.A., Warnow, T.: Greengenes, a chimera-checked 16s rrna gene database and workbench compatible with arb. Appl. Environ. Microbiol.\u00a072, 5069\u20135072 (2006)","journal-title":"Appl. Environ. Microbiol."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1214\/aoap\/1019487349","volume":"10","author":"W. Evans","year":"2000","unstructured":"Evans, W., Kenyon, C., Peres, Y., Schulman, L.J.: Broadcasting on trees and the Ising model. The Annals of Applied Probability\u00a010(2), 410\u2013433 (2000)","journal-title":"The Annals of Applied Probability"},{"key":"2_CR11","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer (2001)"},{"key":"2_CR12","unstructured":"Gronau, I., Moran, S., Snir, S.: Fast and reliable reconstruction of phylogenetic trees with very short edges. In: Proceedings of SODA 2008, pp. 379\u2013388 (2008)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: Proceedings of STOC 1998, New York, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"2_CR14","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":"5934","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1126\/science.1171243","volume":"324","author":"K. Liu","year":"2009","unstructured":"Liu, K., Raghavan, S., Nelesen, S., Linder, C.R., Warnow, T.: Rapid and accurate large-scale coestimation of sequence alignments and phylogenetic trees. Science\u00a0324(5934), 1561\u20131564 (2009)","journal-title":"Science"},{"key":"2_CR16","unstructured":"Mihaescu, R., Hill, C., Rao, S.: Fast phylogeny reconstruction through learning of ancestral sequences (December 08, 2008), \n                  \n                    http:\/\/arxiv.org\/abs\/0812.1587"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"2379","DOI":"10.1090\/S0002-9947-03-03382-8","volume":"356","author":"E. Mossel","year":"2004","unstructured":"Mossel, E.: Phase transitions in phylogeny. Trans. Amer. Math. Soc.\u00a0356, 2379\u20132404 (2004)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"7","key":"2_CR18","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. E\u00a026(7), 1641\u20131650 (2009)","journal-title":"Mol. Biol. E"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1007\/s11538-010-9505-8","volume":"72","author":"L. Zhang","year":"2010","unstructured":"Zhang, L., Shen, J., Yang, J., Li, G.: Analyzing the fitch method for reconstructing ancestral states on ultrametric phylogenetic trees. Bulletin of Mathematical Biology\u00a072, 1760\u20131782 (2010)","journal-title":"Bulletin of Mathematical Biology"}],"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-33122-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:58Z","timestamp":1620129358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}