{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:28:29Z","timestamp":1725582509891},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212598"},{"type":"electronic","value":"9783642212604"}],"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-21260-4_20","type":"book-chapter","created":{"date-parts":[[2011,4,29]],"date-time":"2011-04-29T04:26:59Z","timestamp":1304051219000},"page":"184-196","source":"Crossref","is-referenced-by-count":4,"title":["Fast Local Search for Unrooted Robinson-Foulds Supertrees"],"prefix":"10.1007","author":[{"given":"Ruchi","family":"Chaudhary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Gordon","family":"Burleigh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Fern\u00e1ndez-Baca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B.L. Allen","year":"2001","unstructured":"Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics\u00a05, 1\u201313 (2001)","journal-title":"Annals of Combinatorics"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1186\/1748-7188-5-18","volume":"5","author":"M.S. Bansal","year":"2010","unstructured":"Bansal, M.S., Burleigh, J.G., Eulenstein, O., Fern\u00e1ndez-Baca, D.: Robinson-Foulds supertrees. Algorithms for Molecular Biology\u00a05, 18 (2010)","journal-title":"Algorithms for Molecular Biology"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/1222480","volume":"41","author":"B.R. Baum","year":"1992","unstructured":"Baum, B.R.: Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon\u00a041, 3\u201310 (1992)","journal-title":"Taxon"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1186\/1471-2148-6-93","volume":"6","author":"R.M.D. Beck","year":"2006","unstructured":"Beck, R.M.D., Bininda-Emonds, O.R.P., Cardillo, M., Liu, F.R., Purvis, A.: A higher-level MRP supertree of placental mammals. BMC Evolutionary Biology\u00a06, 93 (2006)","journal-title":"BMC Evolutionary Biology"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1080\/10635150590947113","volume":"54","author":"O.R.P. Bininda-Emonds","year":"2005","unstructured":"Bininda-Emonds, O.R.P., Beck, R.M.D., Purvis, A.: Getting to the roots of matrix representation. Syst. Biol.\u00a054, 668\u2013672 (2005)","journal-title":"Syst. Biol."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1038\/nature05634","volume":"446","author":"O.R.P. Bininda-Emonds","year":"2007","unstructured":"Bininda-Emonds, O.R.P., Cardillo, M., Jones, K.E., MacPhee, R.D.E., Beck, R.M.D., Grenyer, R., Price, S.A., Vos, R.A., Gittleman, J.L., Purvis, A.: The delayed rise of present-day mammals. Nature\u00a0446, 507\u2013512 (2007)","journal-title":"Nature"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1080\/106351501750435112","volume":"50","author":"O.R.P. Bininda-Emonds","year":"2001","unstructured":"Bininda-Emonds, O.R.P., Sanderson, M.J.: Assessment of the accuracy of matrix representation with parsimony analysis supertree construction. Systematic Biology\u00a050, 565\u2013579 (2001)","journal-title":"Systematic Biology"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M. Bordewich","year":"2004","unstructured":"Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics\u00a08, 409\u2013423 (2004)","journal-title":"Annals of Combinatorics"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1017\/S0952836904005539","volume":"264","author":"M. Cardillo","year":"2004","unstructured":"Cardillo, M., Bininda-Emonds, O.R.P., Boakes, E., Purvis, A.: A species-level phylogenetic supertree of marsupials. Journal of Zoology\u00a0264, 11\u201331 (2004)","journal-title":"Journal of Zoology"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1177\/117693430600200003","volume":"2","author":"D. Chen","year":"2006","unstructured":"Chen, D., Eulenstein, O., Fern\u00e1ndez-Baca, D., Burleigh, J.G.: Improved heuristics for minimum-flip supertree construction. Evolutionary Bioinformatics\u00a02, 347\u2013356 (2006)","journal-title":"Evolutionary Bioinformatics"},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1093\/bioinformatics\/bti020","volume":"21","author":"C.J. Creevey","year":"2005","unstructured":"Creevey, C.J., McInerney, J.O.: Clann: Investigating phylogenetic information through supertree analyses. Bioinformatics\u00a021(3), 390\u2013392 (2005)","journal-title":"Bioinformatics"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1073\/pnas.0308127100","volume":"101","author":"T.J. Davies","year":"2004","unstructured":"Davies, T.J., Barraclough, T.G., Chase, M.W., Soltis, P.S., Soltis, D.E., Savolainen, V.: Darwin\u2019s abominable mystery: insights from a supertree of the angiosperms. Proceedings of the National Academy of Sciences of the United States of America\u00a0101, 1904\u20131909 (2004)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1080\/10635150490423719","volume":"53","author":"O. Eulenstein","year":"2003","unstructured":"Eulenstein, O., Chen, D., Burleigh, J.G., Fern\u00e1ndez-Baca, D., Sanderson, M.J.: Performance of flip supertree construction with a heuristic algorithm. Systematic Biology\u00a053, 299\u2013308 (2003)","journal-title":"Systematic Biology"},{"key":"20_CR15","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-39763-2_19","volume-title":"Algorithms in Bioinformatics","author":"G. Ganapathy","year":"2003","unstructured":"Ganapathy, G., Ramachandran, V., Warnow, T.: Better hill-climbing searches for parsimony. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 245\u2013258. Springer, Heidelberg (2003)"},{"key":"20_CR16","unstructured":"Ganapathy, G., Ramachandran, V., Warnow, T.: On contract-and-refine transformations between phylogenetic trees. In: SODA, pp. 900\u2013909 (2004)"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1111\/j.1096-0031.1999.tb00278.x","volume":"15","author":"P.A. Goloboff","year":"1999","unstructured":"Goloboff, P.A.: Analyzing large data sets in reasonable times: Solutions for composite optima. Cladistics\u00a015, 415\u2013428 (1999)","journal-title":"Cladistics"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1111\/j.1096-0031.2005.00064.x","volume":"21","author":"P.A. Goloboff","year":"2005","unstructured":"Goloboff, P.A.: Minority rule supertrees? MRP, compatibility, and minimum flip display the least frequent groups. Cladistics\u00a021, 282\u2013294 (2005)","journal-title":"Cladistics"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1080\/10635150390192771","volume":"52","author":"B. Holland","year":"2003","unstructured":"Holland, B., Penny, D., Hendy, M.: Outgroup misplacement and phylogenetic inaccuracy under a molecular clock -\u2014 a simulation study. Syst. Biol.\u00a052, 229\u2013238 (2003)","journal-title":"Syst. Biol."},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1080\/106351502753475862","volume":"51","author":"J. Huelsenbeck","year":"2002","unstructured":"Huelsenbeck, J., Bollback, J., Levine, A.: Inferring the root of a phylogenetic tree. Syst. Biol.\u00a051, 32\u201343 (2002)","journal-title":"Syst. Biol."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"McMorris, F.R., Steel, M.A.: The complexity of the median procedure for binary trees. In: Proceedings of the International Federation of Classification Societies (1993)","DOI":"10.1007\/978-3-642-51175-2_14"},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/106351502753475925","volume":"51","author":"D. Pisani","year":"2002","unstructured":"Pisani, D., Wilkinson, M.: MRP, taxonomic congruence and total evidence. Systematic Biology\u00a051, 151\u2013155 (2002)","journal-title":"Systematic Biology"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1098\/rspb.2001.1942","volume":"269","author":"D. Pisani","year":"2002","unstructured":"Pisani, D., Yates, A.M., Langer, M.C., Benton, M.J.: A genus-level supertree of the Dinosauria. Proceedings of the Royal Society of London\u00a0269, 915\u2013921 (2002)","journal-title":"Proceedings of the Royal Society of London"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1093\/sysbio\/44.2.251","volume":"44","author":"A. Purvis","year":"1995","unstructured":"Purvis, A.: A modification to Baum and Ragan\u2019s method for combining phylogenetic trees. Systematic Biology\u00a044, 251\u2013255 (1995)","journal-title":"Systematic Biology"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/1055-7903(92)90035-F","volume":"1","author":"M.A. Ragan","year":"1992","unstructured":"Ragan, M.A.: Phylogenetic inference based on matrix representation of trees. Molecular Phylogenetics and Evolution\u00a01, 53\u201358 (1992)","journal-title":"Molecular Phylogenetics and Evolution"},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D.F. Robinson","year":"1981","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Mathematical Biosciences\u00a053, 131\u2013147 (1981)","journal-title":"Mathematical Biosciences"},{"key":"20_CR27","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C. Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)"},{"key":"20_CR28","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1111\/j.1095-8312.1994.tb00962.x","volume":"51","author":"A. Smith","year":"1994","unstructured":"Smith, A.: Rooting molecular trees: problems and strategies. Biol. J. Linn. Soc.\u00a051, 279\u2013292 (1994)","journal-title":"Biol. J. Linn. Soc."},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1111\/j.1096-0031.1990.tb00550.x","volume":"6","author":"W. Wheeler","year":"1990","unstructured":"Wheeler, W.: Nucleic acid sequence phylogeny and random outgroups. Cladistics\u00a06, 363\u2013368 (1990)","journal-title":"Cladistics"},{"key":"20_CR30","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2148-5-2","volume":"5","author":"V. Yap","year":"2005","unstructured":"Yap, V., Speed, T.: Rooting a phylogenetic tree with nonreversible substitution models. BMC Evol. Biol.\u00a05, 2 (2005)","journal-title":"BMC Evol. Biol."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21260-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T12:05:00Z","timestamp":1712405100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21260-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212598","9783642212604"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21260-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}