{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:56Z","timestamp":1725600476471},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"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-22685-4_4","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T04:54:39Z","timestamp":1312952079000},"page":"37-48","source":"Crossref","is-referenced-by-count":1,"title":["FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Malte","family":"Brinkmeyer","sequence":"first","affiliation":[]},{"given":"Thasso","family":"Griebel","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"B\u00f6cker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A.V. Aho","year":"1981","unstructured":"Aho, A.V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput.\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4_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(1), 3\u201310 (1992)","journal-title":"Taxon"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-16001-1_16","volume-title":"Pattern Recognition in Bioinformatics","author":"M. Brinkmeyer","year":"2010","unstructured":"Brinkmeyer, M., Griebel, T., B\u00f6cker, S.: Polynomial supertree methods revisited. In: Dijkstra, T.M.H., Tsivtsivadze, E., Marchiori, E., Heskes, T. (eds.) PRIB 2010. LNCS, vol.\u00a06282, pp. 183\u2013194. Springer, Heidelberg (2010)"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"391","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. Online\u00a02, 391\u2013400 (2006)","journal-title":"Evol. Bioinform. Online"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/TCBB.2006.26","volume":"3","author":"D. Chen","year":"2006","unstructured":"Chen, D., Eulenstein, O., Fern\u00e1ndez-Baca, D., Sanderson, M.: Minimum-flip supertrees: complexity and algorithms. IEEE\/ACM Trans. Comput. Biol. Bioinform.\u00a03(2), 165\u2013173 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Chimani, M., Rahmann, S., B\u00f6cker, S.: Exact ILP solutions for phylogenetic minimum flip problems. In: Proc. of ACM Conf. on Bioinformatics and Computational Biology (ACM-BCB 2010), pp. 147\u2013153 (2010)","DOI":"10.1145\/1854776.1854800"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0025-5564(86)90161-6","volume":"81","author":"W. Day","year":"1986","unstructured":"Day, W., Johnson, D., Sankoff, D.: The computational complexity of inferring rooted phylogenies by parsimony. Math. Biosci.\u00a081, 33\u201342 (1986)","journal-title":"Math. Biosci."},{"key":"4_CR8","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"issue":"20","key":"4_CR9","doi-asserted-by":"publisher","first-page":"2399","DOI":"10.1093\/bioinformatics\/btn364","volume":"24","author":"T. Griebel","year":"2008","unstructured":"Griebel, T., Brinkmeyer, M., B\u00f6cker, S.: EPoS: a modular software framework for phylogenetic analysis. Bioinformatics\u00a024(20), 2399\u20132400 (2008)","journal-title":"Bioinformatics"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D. Gusfield","year":"1991","unstructured":"Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks\u00a021, 19\u201328 (1991)","journal-title":"Networks"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"J.X. Hao","year":"1994","unstructured":"Hao, J.X., Orlin, J.B.: A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms\u00a017(3), 424\u2013446 (1994)","journal-title":"J. Algorithms"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45784-4_41","volume-title":"Algorithms in Bioinformatics","author":"R.D.M. Page","year":"2002","unstructured":"Page, R.D.M.: Modified mincut supertrees. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 537\u2013552. Springer, Heidelberg (2002)"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1137\/S0097539702406510","volume":"33","author":"I. Pe\u2019er","year":"2004","unstructured":"Pe\u2019er, I., Pupko, T., Shamir, R., Sharan, R.: Incomplete directed perfect phylogeny. SIAM J. Comput.\u00a033(3), 590\u2013607 (2004)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4_CR14","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. Phylogenet. Evol.\u00a01(1), 53\u201358 (1992)","journal-title":"Mol. Phylogenet. Evol."},{"issue":"5","key":"4_CR15","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":"12","key":"4_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1093\/bioinformatics\/btq196","volume":"26","author":"V. Ranwez","year":"2010","unstructured":"Ranwez, V., Criscuolo, A., Douzery, E.J.P.: Supertriplets: a triplet-based supertree approach to phylogenomics. Bioinformatics\u00a026(12), i115\u2013i123 (2010)","journal-title":"Bioinformatics"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1186\/1471-2105-9-413","volume":"9","author":"C. Scornavacca","year":"2008","unstructured":"Scornavacca, C., Berry, V., Lefort, V., Douzery, E.J.P., Ranwez, V.: PhySIC_IST: cleaning source trees to infer more informative supertrees. BMC Bioinformatics\u00a09, 413 (2008)","journal-title":"BMC Bioinformatics"},{"issue":"1-3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(00)00202-X","volume":"105","author":"C. Semple","year":"2000","unstructured":"Semple, C., Steel, M.: A supertree method for rooted trees. Discrete Appl. Math.\u00a0105(1-3), 147\u2013158 (2000)","journal-title":"Discrete Appl. Math."},{"key":"4_CR19","unstructured":"Swafford, D., Paup*: Phylogenetic analysis using parsimony (*and other methods), Version 4 (2002)"},{"issue":"1","key":"4_CR20","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., Barbancon, F., Warnow, T., Linder, C.R.: A simulation study comparing supertree and combined analysis methods using SMIDGen. Algorithms Mol. Biol.\u00a05(1), 8 (2010)","journal-title":"Algorithms Mol. Biol."},{"issue":"6","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1016\/j.bulm.2004.04.006","volume":"66","author":"S.J. Willson","year":"2004","unstructured":"Willson, S.J.: Constructing rooted supertrees using distances. Bull. Math. Biol.\u00a066(6), 1755\u20131783 (2004)","journal-title":"Bull. Math. Biol."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:39:27Z","timestamp":1560454767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}