{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:14:01Z","timestamp":1725884041208},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319569697"},{"type":"electronic","value":"9783319569703"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-56970-3_6","type":"book-chapter","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T00:43:49Z","timestamp":1491871429000},"page":"82-98","source":"Crossref","is-referenced-by-count":2,"title":["Determining the Consistency of Resolved Triplets and Fan Triplets"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]},{"given":"Ramesh","family":"Rajaby","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"AV 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. 10(3), 405\u2013421 (1981)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"6_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.tree.2004.03.015","volume":"19","author":"ORP Bininda-Emonds","year":"2004","unstructured":"Bininda-Emonds, O.R.P.: The evolution of supertrees. TRENDS Ecol. Evol. 19(6), 315\u2013322 (2004)","journal-title":"TRENDS Ecol. Evol."},{"key":"6_CR3","doi-asserted-by":"crossref","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 446(7135), 507\u2013512 (2007)","DOI":"10.1038\/nature05634"},{"key":"6_CR4","unstructured":"Bryant, D.: Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis. Ph.D. thesis, University of Canterbury, Christchurch, New Zealand (1997)"},{"issue":"1","key":"6_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.jda.2009.01.004","volume":"8","author":"J Byrka","year":"2010","unstructured":"Byrka, J., Gawrychowski, P., Huber, K.T., Kelk, S.: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. J. Discrete Algorithms 8(1), 65\u201375 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"11","key":"6_CR6","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1016\/j.dam.2010.03.004","volume":"158","author":"J Byrka","year":"2010","unstructured":"Byrka, J., Guillemot, S., Jansson, J.: New results on optimizing rooted triplets consistency. Discrete Appl. Math. 158(11), 1136\u20131147 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"6\u20137","key":"6_CR7","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.dam.2005.05.043","volume":"155","author":"B Chor","year":"2007","unstructured":"Chor, B., Hendy, M., Penny, D.: Analytic solutions for three taxon ML trees with variable rates across sites. Discrete Appl. Math. 155(6\u20137), 750\u2013758 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"6_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01202270","volume":"12","author":"M Constantinescu","year":"1995","unstructured":"Constantinescu, M., Sankoff, D.: An efficient algorithm for supertrees. J. Classif. 12(1), 101\u2013112 (1995)","journal-title":"J. Classif."},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Jansson, J., Lingas, A., Lundell, E.-M.: The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 272\u2013283. Springer, Cham (2015). doi: 10.1007\/978-3-319-19929-0_23","DOI":"10.1007\/978-3-319-19929-0_23"},{"key":"6_CR10","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Inc., Sunderland (2004)"},{"key":"6_CR11","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"2\u20133","key":"6_CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/A:1009833626004","volume":"3","author":"L Ga\u0327sieniec","year":"1999","unstructured":"Ga\u0327sieniec, L., Jansson, J., Lingas, A., \u00d6stlin, A.: On the complexity of constructing evolutionary trees. J. Comb. Optim. 3(2\u20133), 183\u2013197 (1999)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"6_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1142\/S0219720006001709","volume":"4","author":"YJ He","year":"2006","unstructured":"He, Y.J., Huynh, T.N.D., Jansson, J., Sung, W.-K.: Inferring phylogenetic relationships avoiding forbidden rooted triplets. J. Bioinform. Comput. Biol. 4(1), 59\u201374 (2006)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"1","key":"6_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"MR Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V., Warnow, T.: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica 24(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR15","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723\u2013760 (2001)","journal-title":"J. ACM"},{"issue":"1","key":"6_CR16","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/100811489","volume":"41","author":"J Jansson","year":"2012","unstructured":"Jansson, J., Lemence, R.S., Lingas, A.: The complexity of inferring a minimally resolved phylogenetic supertree. SIAM J. Comput. 41(1), 272\u2013291 (2012)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00453-004-1147-5","volume":"43","author":"J Jansson","year":"2005","unstructured":"Jansson, J., Ng, J.H.-K., Sadakane, K., Sung, W.-K.: Rooted maximum agreement supertrees. Algorithmica 43(4), 293\u2013307 (2005)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"6_CR18","first-page":"19","volume":"69","author":"MP Ng","year":"1996","unstructured":"Ng, M.P., Wormald, N.C.: Reconstruction of rooted trees from subtrees. Discrete Appl. Math. 69(1\u20132), 19\u201331 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"6_CR19","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/S0166-218X(02)00250-0","volume":"127","author":"C Semple","year":"2003","unstructured":"Semple, C.: Reconstructing minimal rooted trees. Discrete Appl. Math. 127(3), 489\u2013503 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"15","key":"6_CR20","doi-asserted-by":"crossref","first-page":"2355","DOI":"10.1093\/bioinformatics\/bth246","volume":"20","author":"C Semple","year":"2004","unstructured":"Semple, C., Daniel, P., Hordijk, W., Page, R.D.M., Steel, M.: Supertree algorithms for ancestral divergence dates and nested taxa. Bioinformatics 20(15), 2355\u20132360 (2004)","journal-title":"Bioinformatics"},{"issue":"4","key":"6_CR21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TCBB.2006.58","volume":"3","author":"S Snir","year":"2006","unstructured":"Snir, S., Rao, S.: Using max cut to enhance rooted trees consistency. IEEE\/ACM Trans. Comput. Biol. Bioinform. 3(4), 323\u2013333 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"6_CR22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M Steel","year":"1992","unstructured":"Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. J. Classif. 9(1), 91\u2013116 (1992)","journal-title":"J. Classif."},{"key":"6_CR23","volume-title":"Algorithms in Bioinformatics: A Practical Introduction","author":"W Sung","year":"2010","unstructured":"Sung, W.: Algorithms in Bioinformatics: A Practical Introduction. Chapman & Hall\/CRC, Boca Raton (2010)"},{"issue":"6","key":"6_CR24","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1016\/j.bulm.2004.04.006","volume":"66","author":"SJ Willson","year":"2004","unstructured":"Willson, S.J.: Constructing rooted supertrees using distances. Bull. Math. Biol. 66(6), 1755\u20131783 (2004)","journal-title":"Bull. Math. Biol."},{"issue":"1","key":"6_CR25","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory Comput. 3(1), 103\u2013128 (2007)","journal-title":"Theory Comput."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56970-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T10:37:08Z","timestamp":1498387028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56970-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319569697","9783319569703"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56970-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}