{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:50Z","timestamp":1740109310745,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["JP26280004","JP17K00029"],"award-info":[{"award-number":["JP26280004","JP17K00029"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["JP16J04545","JP17K00029"],"award-info":[{"award-number":["JP16J04545","JP17K00029"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["JP19J01302","20K23323"],"award-info":[{"award-number":["JP19J01302","20K23323"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["20H05795"],"award-info":[{"award-number":["20H05795"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00453-022-00945-9","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T12:03:15Z","timestamp":1645617795000},"page":"1875-1896","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reconstructing Phylogenetic Trees from Multipartite Quartet Systems"],"prefix":"10.1007","volume":"84","author":[{"given":"Hiroshi","family":"Hirai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6794-3543","authenticated-orcid":false,"given":"Yuni","family":"Iwamasa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"issue":"3","key":"945_CR1","doi-asserted-by":"publisher","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."},{"key":"945_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-8858(86)90038-2","volume":"7","author":"H-J Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Dress, A.: Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math. 7, 309\u2013343 (1986)","journal-title":"Adv. Appl. Math."},{"key":"945_CR3","unstructured":"Berry, V., Bryant, D., Jiang, T., Kearney, P., Li, M., Wareham, T., Zhang, H.: A practical algorithm for recovering the best supported edges of an evolutionary tree. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA\u201900), pp. 287\u2013296 (2000)"},{"key":"945_CR4","doi-asserted-by":"crossref","unstructured":"Berry, V., Jiang, T., Kearney, P., Li, M., Wareham, T.: Quartet cleaning: Improved algorithms and simulations. In: Proceedings of the 7th European Symposium on Algorithm (ESA\u201999), Lecture Notes in Computer Science, vol. 1643, pp. 313\u2013324. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48481-7_28"},{"key":"945_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1006\/aama.1995.1020","volume":"16","author":"D Bryant","year":"1995","unstructured":"Bryant, D., Steel, M.: Extension operations on sets of leaf-labelled trees. Adv. Appl. Math. 16, 425\u2013453 (1995)","journal-title":"Adv. Appl. Math."},{"key":"945_CR6","first-page":"387","volume-title":"Mathematics in the Archaeological and Historical Science","author":"P Buneman","year":"1971","unstructured":"Buneman, P.: The recovery of trees from measures of dissimilarity. In: Hodson, F.R., Kendall, D.G., Tautu, P. (eds.) Mathematics in the Archaeological and Historical Science, pp. 387\u2013395. Edinburgh University Press, Edinburgh (1971)"},{"issue":"2","key":"945_CR7","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/s00224-009-9165-y","volume":"47","author":"M-S Chang","year":"2010","unstructured":"Chang, M.-S., Lin, C.-C., Rossmanith, P.: New fixed-parameter algorithms for the minimum quartet inconsistency problem. Theory Comput. Syst. 47(2), 342\u2013367 (2010)","journal-title":"Theory Comput. Syst."},{"key":"945_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1111\/j.2044-8317.1981.tb00626.x","volume":"34","author":"H Colonius","year":"1981","unstructured":"Colonius, H., Schulze, H.H.: Tree structure from proximity data. Br. J. Math. Stat. Psychol. 34, 167\u2013180 (1981)","journal-title":"Br. J. Math. Stat. Psychol."},{"key":"945_CR9","unstructured":"Dekker, M.C.H.: Reconstruction Methods for Derivation Trees. Master\u2019s thesis, Vrije Universiteit (1986)"},{"issue":"2","key":"945_CR10","first-page":"217","volume":"16","author":"PL Erd\u00f6s","year":"1997","unstructured":"Erd\u00f6s, P.L., Steel, M.A., Sz\u00e9kely, L.A., Warnow, T.J.: Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule. Comput. Artif. Intell. 16(2), 217\u2013227 (1997)","journal-title":"Comput. Artif. Intell."},{"key":"945_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01733209","volume":"18","author":"WM Fitch","year":"1981","unstructured":"Fitch, W.M.: A non-sequential method for constructing trees and hierarchical classifications. J. Mol. Evol. 18, 30\u201337 (1981)","journal-title":"J. Mol. Evol."},{"key":"945_CR12","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/S0022-0000(03)00077-1","volume":"67","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R.: A fixed-parameter algorithm for minimum quartet inconsistency. J. Comput. Syst. Sci. 67, 723\u2013741 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"945_CR13","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/3329862","volume":"15","author":"H Hirai","year":"2019","unstructured":"Hirai, H., Iwamasa, Y., Murota, K., \u017divn\u00fd, S.: A tractable class of binary VCSPs via M-convex intersection. ACM Trans. Algorithms 15(3), 44:1-44:41 (2019)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"945_CR14","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 J. Comput. 30(6), 1942\u20131961 (2001)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"945_CR15","doi-asserted-by":"publisher","first-page":"e104008","DOI":"10.1371\/journal.pone.0104008","volume":"9","author":"R Reaz","year":"2014","unstructured":"Reaz, R., Bayzid, M.S., Rahman, M.S.: Accurate phylogenetic tree reconstruction from quartets: a heuristic approach. PLoS ONE 9(8), e104008 (2014)","journal-title":"PLoS ONE"},{"key":"945_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF02293654","volume":"42","author":"S Sattath","year":"1977","unstructured":"Sattath, S., Tversky, A.: Additive similarity trees. Psychometrika 42, 319\u2013345 (1977)","journal-title":"Psychometrika"},{"key":"945_CR17","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"945_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. 105, 147\u2013158 (2000)","journal-title":"Discrete Appl. Math."},{"key":"945_CR19","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":"945_CR20","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. J. Classif. 9, 91\u2013116 (1992)","journal-title":"J. Classif."},{"key":"945_CR21","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","volume":"13","author":"K Strimmer","year":"1996","unstructured":"Strimmer, K., Haeseler, A.: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. J. Mol. Biol. Evol. 13, 964\u2013969 (1996)","journal-title":"J. Mol. Biol. Evol."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00945-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00945-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00945-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T23:42:47Z","timestamp":1700264567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00945-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,23]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["945"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00945-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,2,23]]},"assertion":[{"value":"27 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}