{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:39:56Z","timestamp":1725565196925},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152931"},{"type":"electronic","value":"9783642152948"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15294-8_24","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T08:51:46Z","timestamp":1284108706000},"page":"288-299","source":"Crossref","is-referenced-by-count":3,"title":["An Experimental Study of Quartets MaxCut and Other Supertree Methods"],"prefix":"10.1007","author":[{"given":"M. Shel","family":"Swenson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Suri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Randal","family":"Linder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tandy","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, M., Burleigh, J.G., Eulenstein, O., Fern\u00e1ndez-Baca, D.: Robinson-foulds supertrees (2009)","DOI":"10.1186\/1748-7188-5-18"},{"key":"24_CR2","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":"24_CR3","doi-asserted-by":"crossref","unstructured":"Ben-dor, A., Chor, B., Graur, D., Ophir, R., Pelleg, D.: Constructing phylogenies from quartets: Elucidation of eutherian superordinal relationships. Journal of Computational Biology\u00a05(3), 377\u2013390 (1998), Earlier version appeared in RECOMB 1998 (1998)","DOI":"10.1089\/cmb.1998.5.377"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tree.2004.03.015","volume":"19","author":"O.R.P. Bininda-Emonds","year":"2004","unstructured":"Bininda-Emonds, O.R.P.: The evolution of supertrees. Trends in Ecology and Evolution\u00a019, 315\u2013322 (2004)","journal-title":"Trends in Ecology and Evolution"},{"key":"24_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-2330-9","volume-title":"Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life. Computational Biology","author":"O.R.P. Bininda-Emonds","year":"2004","unstructured":"Bininda-Emonds, O.R.P.: Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life. Computational Biology. Kluwer Academic, Dordrecht (2004)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3-540-55719-9_80","volume-title":"Automata, Languages and Programming","author":"H. Bolaender","year":"1992","unstructured":"Bolaender, H., Fellows, M., Warnow, T.: Two strikes against perfect phylogeny. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 273\u2013283. Springer, Heidelberg (1992)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-1-4020-2330-9_4","volume-title":"Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life","author":"J.G. Burleigh","year":"2004","unstructured":"Burleigh, J.G., Eulenstein, O., Fern\u00e1ndez-Baca, D., Sanderson, M.J.: MRF supertrees. In: Bininda-Emonds, O.R.P. (ed.) Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life, pp. 65\u201386. Kluwer Academic, Dordrecht (2004)"},{"key":"24_CR8","series-title":"DIMACS: Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1090\/dimacs\/061\/10","volume-title":"Bioconsensus","author":"D. Chen","year":"2003","unstructured":"Chen, D., Diao, L., Eulenstein, O., Fern\u00e1ndez-Baca, D., Sanderson, M.J.: Flipping: a supertree construction method. In: Bioconsensus. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a061, pp. 135\u2013160. American Mathematical Society-DIMACS, Providence (2003)"},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"401","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. Evol. Bioinform.\u00a02, 401\u2013410 (2006)","journal-title":"Evol. Bioinform."},{"issue":"3","key":"24_CR10","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"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0893-9659(92)90026-6","volume":"5","author":"A. Dress","year":"1992","unstructured":"Dress, A., Steel, M.: Convex tree realizations of partitions. Applied Mathematics Letters\u00a05(3), 3\u20136 (1992)","journal-title":"Applied Mathematics Letters"},{"issue":"43-49","key":"24_CR12","first-page":"299","volume":"3","author":"L.R. Foulds","year":"1982","unstructured":"Foulds, L.R., Graham, R.L.: The steiner problem in phylogeny is NP-complete. Adv. in Appl. Math.\u00a03(43-49), 299 (1982)","journal-title":"Adv. in Appl. Math."},{"issue":"1","key":"24_CR13","first-page":"299","volume":"57","author":"B. Holland","year":"2007","unstructured":"Holland, B., Conner, G., Huber, K., Moulton, V.: Imputing supertrees and supernetworks from quartets. Syst. Biol.\u00a057(1), 299\u2013308 (2007)","journal-title":"Syst. Biol."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Jiang, T., Kearney, P., Li, M.: Orchestrating quartets: approximation and data correction. In: Motwani, R. (ed.) Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, Los Alamitos, CA., pp. 416\u2013425 (1998)","DOI":"10.1109\/SFCS.1998.743492"},{"issue":"6","key":"24_CR15","doi-asserted-by":"publisher","first-page":"1924","DOI":"10.1137\/S0097539799361683","volume":"30","author":"T. Jiang","year":"2001","unstructured":"Jiang, T., Kearney, P., Li, M.: A polynomial-time approximation scheme for inferring evolutionary trees from quartet topologies and its applications. SIAM J. Comput.\u00a030(6), 1924\u20131961 (2001)","journal-title":"SIAM J. Comput."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"John, K.S., Warnow, T., Moret, B.M.E., Vawter, L.: Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. Journal of Algorithms\u00a048, 173\u2013193 (2003)","DOI":"10.1016\/S0196-6774(03)00049-X"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1111\/j.1096-0031.1999.tb00277.x","volume":"15","author":"K.C. Nixon","year":"1999","unstructured":"Nixon, K.C.: The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics\u00a015, 407\u2013414 (1999)","journal-title":"Cladistics"},{"key":"24_CR18","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. Mol. Phylo. Evol.\u00a01, 53\u201358 (1992)","journal-title":"Mol. Phylo. Evol."},{"issue":"5","key":"24_CR19","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1080\/10635150701639754","volume":"56","author":"V. Ranwez","year":"2007","unstructured":"Ranwez, V., Berry, V., Criscuolo, A., Fabre, P.H., Guillemot, S., Scornavacca, C., Douzery, E.J.P.: PhySIC: a veto supertree method with desirable properties. Syst. Biol.\u00a056(5), 798\u2013817 (2007)","journal-title":"Syst. Biol."},{"issue":"6","key":"24_CR20","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."},{"key":"24_CR21","unstructured":"Snir, S., Rao, S.: Quartets MaxCut: a divide and conquer quartets algorithm. IEEE\/ACM Trans. Comput. Biol. Bioinform. (2008)"},{"issue":"1","key":"24_CR22","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. Comput. Biol.\u00a015(1), 91\u2013103 (2008)","journal-title":"J. Comput. Biol."},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"2688","DOI":"10.1093\/bioinformatics\/btl446","volume":"22","author":"A. Stamatakis","year":"2006","unstructured":"Stamatakis, A.: RAxML-NI-HPC: Maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics\u00a022, 2688\u20132690 (2006)","journal-title":"Bioinformatics"},{"issue":"7","key":"24_CR24","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 maximim-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution\u00a013(7), 964\u2013969 (1996)","journal-title":"Molecular Biology and Evolution"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1186\/1748-7188-5-8","volume":"5","author":"M.S. Swenson","year":"2010","unstructured":"Swenson, M.S., Barban\u00e7on, F., Warnow, T., Linder, C.R.: A simulation study comparing supertree and combined analysis methods using SMIDGen. Algorithms for Molecular Biology\u00a05, 8 (2010)","journal-title":"Algorithms for Molecular Biology"},{"key":"24_CR26","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/cpe.938","volume":"17","author":"D. Thain","year":"2005","unstructured":"Thain, D., Tannenbaum, T., Livny, M.: Distributed computing in practice: the Condor experience. Concurrency and Computation: Practice and Experience\u00a017, 323\u2013356 (2005)","journal-title":"Concurrency and Computation: Practice and Experience"}],"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-15294-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T10:56:34Z","timestamp":1559645794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}