{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T21:28:38Z","timestamp":1694640518286},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T00:00:00Z","timestamp":1353888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1186\/1748-7188-7-32","type":"journal-article","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T23:16:11Z","timestamp":1353971771000},"source":"Crossref","is-referenced-by-count":4,"title":["Towards a practical O(n logn) phylogeny algorithm"],"prefix":"10.1186","volume":"7","author":[{"given":"Jakub","family":"Truszkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanqi","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel G","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,26]]},"reference":[{"issue":"1-2","key":"167_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0304-3975(99)00028-6","volume":"221","author":"PL Erd\u00f6s","year":"1999","unstructured":"Erd\u00f6s PL, Steel MA, Sz\u00e9kely LA, Warnow T: A Few Logs Suffice to Build (almost) All Trees: Part II. Theor. Comput. Sci. 1999, 221 (1-2): 77-118. 10.1016\/S0304-3975(99)00028-6","journal-title":"Theor. Comput. Sci"},{"issue":"6","key":"167_CR2","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. 2007, 104 (6): 205-210. 10.1016\/j.ipl.2007.07.002","journal-title":"Inf. Process. Lett"},{"key":"167_CR3","first-page":"147","volume-title":"Proceedings of CPM","author":"DG Brown","year":"2011","unstructured":"Brown DG, Truszkowski J: Fast error-tolerant quartet phylogeny algorithms. Proceedings of CPM. 2011, 147-161. Palermo, Italy; LNCS 6661."},{"key":"167_CR4","first-page":"14","volume-title":"Proceedings of WABI","author":"DG Brown","year":"2011","unstructured":"Brown DG, Truszkowski J: Towards a practical O(n logn) phylogeny algorithm. Proceedings of WABI. 2011, 14-25. Saarbr\u00fccken, Germany; LNCS 6833."},{"key":"167_CR5","first-page":"881","volume-title":"Proceedings of SODA","author":"RM Karp","year":"2007","unstructured":"Karp RM, Kleinberg R: Noisy binary search and its applications. Proceedings of SODA. USA: New Orleans, Louisiana, 2007, 881-890."},{"key":"167_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1145\/279069.279105","volume-title":"Proceedings of RECOMB","author":"PE Kearney","year":"1998","unstructured":"Kearney PE: The ordinal quartet method. Proceedings of RECOMB. New York, New York, USA, 1998, 125-134."},{"key":"167_CR7","first-page":"375","volume-title":"Proceedings of WABI","author":"TJ Wheeler","year":"2009","unstructured":"Wheeler TJ: Large-Scale Neighbor-Joining with NINJA. Proceedings of WABI. Philadelphia, Pennsylvania, USA; LNCS 5724, 2009, 375-389."},{"key":"167_CR8","first-page":"1263","volume-title":"Proceedings of ICALP","author":"I Elias","year":"2005","unstructured":"Elias I, Lagergren J: Fast Neighbor Joining. Proceedings of ICALP. Lisbon, Portugal; LNCS 3580, 2005, 1263-1274."},{"issue":"7","key":"167_CR9","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1093\/molbev\/msp077","volume":"26","author":"MN Price","year":"2009","unstructured":"Price MN, Dehal PS, Arkin AP: FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix. Mol Biol Evol. 2009, 26 (7): 1641-1650. 10.1093\/molbev\/msp077","journal-title":"Mol Biol Evol"},{"issue":"5","key":"167_CR10","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. 2002, 9 (5): 687-706. 10.1089\/106652702761034136","journal-title":"J Comp Biol"},{"issue":"2","key":"167_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1089\/10665270252935467","volume":"9","author":"M Csu\u030br\u00f6s","year":"2002","unstructured":"Csu\u030br\u00f6s M: Fast Recovery of Evolutionary Trees with Thousands of Nodes. J Comp Biol. 2002, 9 (2): 277-297. 10.1089\/10665270252935467","journal-title":"J Comp Biol"},{"key":"167_CR12","first-page":"451","volume-title":"Proceedings of RECOMB","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis C, Mossel E, Roch S: Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. Proceedings of RECOMB. Budapest, Hungary; LNCS 5817, 2009, 451-465."},{"key":"167_CR13","first-page":"444","volume-title":"Proceedings of SODA","author":"V King","year":"2003","unstructured":"King V, Zhang L, Zhou Y: On the complexity of distance-based evolutionary tree reconstruction. Proceedings of SODA. Baltimore, Maryland, USA 2003, 444-453."},{"key":"167_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jagm.1996.0035","volume":"21","author":"SK Kannan","year":"1996","unstructured":"Kannan SK, Lawler EL, Warnow TJ: Determining the Evolutionary Tree Using Experiments. J Algorithms. 1996, 21: 26-50. 10.1006\/jagm.1996.0035","journal-title":"J Algorithms"},{"key":"167_CR15","first-page":"285","volume-title":"Proceedings of SODA","author":"D Bryant","year":"2000","unstructured":"Bryant D, Tsang J, Kearney PE, Li M: Computing the quartet distance between evolutionary trees. Proceedings of SODA. Francisco, California, USA, 2000, 285-286."},{"issue":"2","key":"167_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00453-003-1065-y","volume":"38","author":"GS Brodal","year":"2003","unstructured":"Brodal GS, Fagerberg R, Pedersen CNS: Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). Algorithmica. 2003, 38 (2): 377-395.","journal-title":"Algorithmica"},{"issue":"7","key":"167_CR17","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: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Mol Biol Evol. 1996, 13 (7): 964-969. 10.1093\/oxfordjournals.molbev.a025664","journal-title":"Mol Biol Evol"},{"issue":"2","key":"167_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. 1996, 14 (2): 210-211.","journal-title":"Mol Biol Evol"},{"issue":"6","key":"167_CR19","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. 2001, 18 (6): 1103-1116. 10.1093\/oxfordjournals.molbev.a003881","journal-title":"Mol Biol Evol"},{"key":"167_CR20","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. 2008, 15: 91-103. 10.1089\/cmb.2007.0103","journal-title":"J Comp Biol"},{"key":"167_CR21","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1186\/1471-2105-6-108","volume":"6","author":"ELL Sonnhammer","year":"2005","unstructured":"Sonnhammer ELL, Hollich V: Scoredist: A simple and robust protein sequence distance estimator. BMC Bioinf. 2005, 6: 108-10.1186\/1471-2105-6-108. 10.1186\/1471-2105-6-108","journal-title":"BMC Bioinf"},{"issue":"11","key":"167_CR22","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1093\/bioinformatics\/18.11.1546","volume":"18","author":"KL Howe","year":"2002","unstructured":"Howe KL, Bateman A, Durbin R: QuickTree: building huge Neighbour Joining trees of protein sequences. Bioinformatics. 2002, 18 (11): 1546-1547. 10.1093\/bioinformatics\/18.11.1546","journal-title":"Bioinformatics"},{"issue":"5934","key":"167_CR23","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, Warnow T: Rapid and accurate large-scale coestimation of sequence alignments and phylogenetic trees. Science. 2009, 324 (5934): 1561-1564. 10.1126\/science.1171243","journal-title":"Science"},{"issue":"2","key":"167_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1093\/bioinformatics\/14.2.157","volume":"14","author":"J Stoye","year":"1998","unstructured":"Stoye J, Evers D, Meyer F: Rose: generating sequence families. Bioinformatics. 1998, 14 (2): 157-163. 10.1093\/bioinformatics\/14.2.157","journal-title":"Bioinformatics"},{"issue":"2","key":"167_CR25","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1093\/bioinformatics\/19.2.301","volume":"19","author":"MJ Sanderson","year":"2003","unstructured":"Sanderson MJ: r8s: inferring absolute rates of molecular evolution, divergence times in the absence of a molecular clock. Bioinformatics. 2003, 19 (2): 301-302. 10.1093\/bioinformatics\/19.2.301 10.1093\/bioinformatics\/19.2.301","journal-title":"Bioinformatics"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-7-32.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-7-32\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-7-32.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:48:44Z","timestamp":1548114524000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-7-32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,26]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-7-32","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,26]]},"article-number":"32"}}