{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T19:51:32Z","timestamp":1696621892927},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,2]],"date-time":"2012-05-02T00:00:00Z","timestamp":1335916800000},"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-8","type":"journal-article","created":{"date-parts":[[2012,5,2]],"date-time":"2012-05-02T00:14:30Z","timestamp":1335917670000},"source":"Crossref","is-referenced-by-count":8,"title":["Reconciling taxonomy and phylogenetic inference: formalism and algorithms for describing discord and inferring taxonomic roots"],"prefix":"10.1186","volume":"7","author":[{"given":"Frederick A","family":"Matsen","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Gallagher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,2]]},"reference":[{"key":"148_CR1","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1186\/1471-2105-8-402","volume":"8","author":"D Dalevi","year":"2007","unstructured":"Dalevi D, DeSantis T, Fredslund J, Andersen G, Markowitz V, Hugenholtz P: Automated group assignment in large phylogenetic trees using GRUNT: GRouping, Ungrouping, Naming Tool. BMC Bioinformatics. 2007, 8: 402- 10.1186\/1471-2105-8-402","journal-title":"BMC Bioinformatics"},{"key":"148_CR2","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1038\/ismej.2011.139","volume":"6","author":"D McDonald","year":"2012","unstructured":"McDonald D, Price M, Goodrich J, Nawrocki E, DeSantis T, Probst A, Andersen G, Knight R, Hugenholtz P: An improved Greengenes taxonomy with explicit ranks for ecological and evolutionary analyses of bacteria and archaea. The ISME Journal. 2012, 6: 610-618. 10.1038\/ismej.2011.139","journal-title":"The ISME Journal"},{"key":"148_CR3","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1016\/j.jcss.2007.03.006","volume":"73","author":"S Moran","year":"2007","unstructured":"Moran S, Snir S: Efficient approximation of convex recolorings. Journal of Computer and System Sciences. 2007, 73: 1078-1089. 10.1016\/j.jcss.2007.03.006","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"148_CR4","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.jcss.2007.10.003","volume":"74","author":"S Moran","year":"2008","unstructured":"Moran S, Snir S: Convex recolorings of strings and trees: Definitions, hardness results and algorithms. Journal of Computer and System Sciences. 2008, 74 (5): 850-869. 10.1016\/j.jcss.2007.10.003","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-3","key":"148_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"J Hein","year":"1996","unstructured":"Hein J, Jiang T, Wang L, Zhang K: On the complexity of comparing evolutionary trees. Discrete Applied Mathematics. 1996, 71 (1-3): 153-169. 10.1016\/S0166-218X(96)00062-5","journal-title":"Discrete Applied Mathematics"},{"key":"148_CR6","first-page":"86","volume-title":"Proceedings of COCOON 2007. Springer","author":"HL Bodlaender","year":"2007","unstructured":"Bodlaender HL, Fellows MR, Langston MA, Ragan MA, Rosamond FA, Weyer M: Quadratic kernelization for convex recoloring of trees. Proceedings of COCOON 2007. Springer. 2007, 86-96."},{"key":"148_CR7","unstructured":"Berend D, Tassa T: Improved bounds on Bell numbers and on moments of sums of random variables. Probability and Mathematical Statistics. 2010, 30 (2):"},{"key":"148_CR8","first-page":"19","volume":"9","author":"E Bachoore","year":"2006","unstructured":"Bachoore E, Bodlaender H: Convex recoloring of leaf-colored trees. Proc 3rd ACiD. Texts in Algorithmics. 2006, 9: 19-33.","journal-title":"Proc 3rd ACiD. Texts in Algorithmics"},{"key":"148_CR9","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-540-79228-4_43","volume-title":"Proceedings of the 5th international conference on Theory and applications of models of computation","author":"O Ponta","year":"2008","unstructured":"Ponta O, H\u00fcffner F, Niedermeier R: Speeding up dynamic programming for some NP-hard graph recoloring problems. Proceedings of the 5th international conference on Theory and applications of models of computation. 2008, 490-501. Springer-Verlag"},{"issue":"21","key":"148_CR10","doi-asserted-by":"publisher","first-page":"2688","DOI":"10.1093\/bioinformatics\/btl446","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. Bioinformatics. 2006, 22 (21): 2688- 10.1093\/bioinformatics\/btl446","journal-title":"Bioinformatics"},{"issue":"3","key":"148_CR11","doi-asserted-by":"publisher","first-page":"e9490","DOI":"10.1371\/journal.pone.0009490","volume":"5","author":"M Price","year":"2010","unstructured":"Price M, Dehal P, Arkin A: FastTree 2-approximately maximum-likelihood trees for large alignments. PLoS One. 2010, 5 (3): e9490- 10.1371\/journal.pone.0009490","journal-title":"PLoS One"},{"key":"148_CR12","unstructured":"OCaml. \n                    http:\/\/caml.inria.fr\/ocaml\/index.en.html"},{"key":"148_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/1471-2105-4-41","volume":"4","author":"R Tatusov","year":"2003","unstructured":"Tatusov R, Fedorova N, Jackson J, Jacobs A, Kiryutin B, Koonin E, Krylov D, Mazumder R, Mekhedov S, Nikolskaya A: The COG database: an updated version includes eukaryotes. BMC Bioinformatics. 2003, 4: 41- 10.1186\/1471-2105-4-41","journal-title":"BMC Bioinformatics"},{"key":"148_CR14","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2148-5-2","volume":"5","author":"VB Yap","year":"2005","unstructured":"Yap VB, Speed T: Rooting a phylogenetic tree with nonreversible substitution models. BMC Evolutionary Biology. 2005, 5: 2- 10.1186\/1471-2148-5-2","journal-title":"BMC Evolutionary Biology"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-7-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-7-8\/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-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:47:48Z","timestamp":1548114468000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-7-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["148"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-7-8","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,2]]},"article-number":"8"}}