{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:04:58Z","timestamp":1742922298152,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_24","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"260-271","source":"Crossref","is-referenced-by-count":2,"title":["Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Chester","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.11646\/zootaxa.1668.1.4","volume":"1668","author":"D. Maddison","year":"2007","unstructured":"Maddison, D., Schulz, K., Maddison, W.: The Tree of Life Web Project. Zootaxa\u00a01668, 19\u201340 (2007)","journal-title":"Zootaxa"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R","volume":"14","author":"P. Erd\u0151s","year":"1999","unstructured":"Erd\u0151s, P., Steel, M., Sz\u00e9kely, L., Warnow, T.: A few logs suffice to build (almost) all trees (i). Random Structures and Algorithms\u00a014(2), 153\u2013184 (1999)","journal-title":"Random Structures and Algorithms"},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1942","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 application. SIAM Journal on Computing\u00a030(6), 1942\u20131961 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-22935-0_29","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Snir","year":"2011","unstructured":"Snir, S., Yuster, R.: A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX\/RANDOM 2011. LNCS, vol.\u00a06845, pp. 339\u2013350. Springer, Heidelberg (2011)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Snir, S., Yuster, R.: Reconstructing approximate phylogenetic trees from quartet samples. In: SODA 2010: Proceedings of the Twenty-First ACM-SIAM Symposium on Discrete Algorithms, pp. 1035\u20131044 (2010)","DOI":"10.1137\/1.9781611973075.84"},{"issue":"4","key":"24_CR6","doi-asserted-by":"publisher","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 Transactions on Computational Biology and Bioinformatics\u00a03(4), 323\u2013333 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TCBB.2008.133","volume":"7","author":"S. Snir","year":"2010","unstructured":"Snir, S., Rao, S.: Quartets MaxCut: A divide and conquer quartets algorithm. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a07(4), 704\u2013718 (2010)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A. Aho","year":"1981","unstructured":"Aho, A., Sagiv, Y., Szymanski, T., Ullman, J.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR9","doi-asserted-by":"publisher","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. Journal of Classification\u00a09, 91\u2013116 (1992)","journal-title":"Journal of Classification"},{"key":"24_CR10","unstructured":"Bryant, D.: Building Trees, Hunting for Trees, and Comparing Trees. PhD thesis, Department of Mathematics, University of Canterbury, New Zealand (1997)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S1571-0653(04)00222-7","volume":"7","author":"J. Jansson","year":"2001","unstructured":"Jansson, J.: On the complexity of inferring rooted evolutionary trees. Electronic Notes in Discrete Mathematics\u00a07, 50\u201353 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/B:JOCO.0000021936.04215.68","volume":"8","author":"B. Wu","year":"2004","unstructured":"Wu, B.: Constructing the maximum consensus tree from rooted triples. Journal of Combinatorial Optimization\u00a08(1), 29\u201339 (2004)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"11","key":"24_CR13","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0158(11), 1136\u20131147 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-13562-0_23","volume-title":"Theory and Applications of Models of Computation","author":"S. Guillemot","year":"2010","unstructured":"Guillemot, S., Mnich, M.: Kernel and fast algorithm for dense triplet inconsistency. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol.\u00a06108, pp. 247\u2013257. Springer, Heidelberg (2010)"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","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., Kelk, S.: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. Journal of Discrete Algorithms\u00a08(1), 65\u201375 (2010)","journal-title":"Journal of Discrete Algorithms"},{"issue":"4","key":"24_CR16","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S0219720009004308","volume":"7","author":"L. Iersel","year":"2009","unstructured":"Iersel, L., Kelk, S., Mnich, M.: Uniqueness, intractability and exact algorithms: Reflections on level-k phylogenetic networks. Journal of Bioinformatics and Computational Biology\u00a07(4), 597\u2013623 (2009)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"24_CR17","unstructured":"Jansson, J., Lingas, A., Lundell, E.: A triplet approach to approximations of evolutionary trees. Poster H15 presented at RECOMB 2004: Manuscript obtained from first author\u2019s homepage (2004)"},{"issue":"2","key":"24_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1009833626004","volume":"3","author":"L. Gasieniec","year":"1999","unstructured":"Gasieniec, L., Jansson, J., Lingas, A., \u00d6stlin, A.: On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization\u00a03(2), 183\u2013197 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"24_CR19","unstructured":"Basu, S., Davidson, I., Wagstaff, K.: Constrainted Clustering: Advances in Algorithms, Theory, and Applications. CRC Press (2009)"},{"issue":"1","key":"24_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N. Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning\u00a056(1), 89\u2013113 (2004)","journal-title":"Machine Learning"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC 2007: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 95\u2013103 (2007)","DOI":"10.1145\/1250790.1250806"},{"issue":"3","key":"24_CR22","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N. Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM Journal on Discrete Mathematics\u00a023(3), 1400\u20131415 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"24_CR23","volume-title":"Approximation Algorithms for NP-hard Problems","author":"S. Arora","year":"1996","unstructured":"Arora, S., Lund, C.: Hardness of approximations. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, PWS Publishing, Boston (1996)"},{"key":"24_CR24","unstructured":"Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorithms. McGraw-Hill (2008)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T11:45:51Z","timestamp":1676807151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}