{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:44Z","timestamp":1740141884974,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T00:00:00Z","timestamp":1543276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10288-018-0394-2","type":"journal-article","created":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T22:22:49Z","timestamp":1543270969000},"page":"401-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An exact algorithm for the minimum quartet tree cost problem"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7357-5858","authenticated-orcid":false,"given":"Sergio","family":"Consoli","sequence":"first","affiliation":[]},{"given":"Jan","family":"Korst","sequence":"additional","affiliation":[]},{"given":"Gijs","family":"Geleijnse","sequence":"additional","affiliation":[]},{"given":"Steffen","family":"Pauws","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,27]]},"reference":[{"key":"394_CR1","unstructured":"Cameron PJ (2000a) Sequences realized by oligomorphic permutation groups. J Integer Seq 3. Article: 00.1.5"},{"issue":"1\u20133","key":"394_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0012-365X(00)00148-5","volume":"225","author":"PJ Cameron","year":"2000","unstructured":"Cameron PJ (2000b) Some counting problems related to permutation groups. Discrete Math 225(1\u20133):77\u201392","journal-title":"Discrete Math"},{"issue":"4","key":"394_CR3","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R Cilibrasi","year":"2005","unstructured":"Cilibrasi R, Vit\u00e1nyi PMB (2005) Clustering by compression. IEEE Trans Inf Theory 51(4):1523\u20131545","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"394_CR4","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TKDE.2007.48","volume":"19","author":"R Cilibrasi","year":"2007","unstructured":"Cilibrasi R, Vit\u00e1nyi PMB (2007) The google similarity distance. IEEE Trans Knowl Data Eng 19(3):370\u2013383","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"394_CR5","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.patcog.2010.08.033","volume":"44","author":"R Cilibrasi","year":"2011","unstructured":"Cilibrasi R, Vit\u00e1nyi PMB (2011) A fast quartet tree heuristic for hierarchical clustering. Pattern Recognit 44(3):662\u2013677","journal-title":"Pattern Recognit"},{"issue":"4","key":"394_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1162\/0148926042728449","volume":"28","author":"R Cilibrasi","year":"2004","unstructured":"Cilibrasi R, Vit\u00e1nyi PMB, de Wolf R (2004) Algorithmic clustering of music based on string compression. Comput Music J 28(4):49\u201367","journal-title":"Comput Music J"},{"issue":"10","key":"394_CR7","doi-asserted-by":"publisher","first-page":"1428","DOI":"10.1109\/TKDE.2009.188","volume":"22","author":"S Consoli","year":"2010","unstructured":"Consoli S, Darby-Dowman K, Geleijnse G, Korst J, Pauws S (2010) Heuristic approaches for the quartet method of hierarchical clustering. IEEE Trans Knowl Data Eng 22(10):1428\u20131443","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"394_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.endm.2012.10.011","volume":"39","author":"S. Consoli","year":"2012","unstructured":"Consoli S, Moreno-P\u00e9rez JA (2012) Solving the minimum labelling spanning tree problem using hybrid local search. In: Proceedings of the mini EURO conference XXVIII on variable neighbourhood search (EUROmC-XXVIII-VNS), vol 39. Electronic notes in discrete mathematics, Hergeg Novi, Montenegro, pp 75\u201382","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"394_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.endm.2014.11.003","volume":"47","author":"S Consoli","year":"2015","unstructured":"Consoli S, Stilianakis NI (2015) A VNS-based quartet algorithm for biomedical literature clustering. Electron Notes Discrete Math 47:13\u201320","journal-title":"Electron Notes Discrete Math"},{"issue":"3","key":"394_CR10","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1111\/itor.12240","volume":"24","author":"S Consoli","year":"2017","unstructured":"Consoli S, Stilianakis NI (2017) A quartet method based on variable neighborhood search for biomedical literature extraction and clustering. Int Trans Oper Res 24(3):537\u2013558","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"394_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0166-1280(95)04329-6","volume":"357","author":"SJ Cyvin","year":"1995","unstructured":"Cyvin SJ, Brunvoll J, Cyvin BN (1995) Enumeration of constitutional isomers of polyenes. J Mol Struct (Theochem) 357(3):255\u2013261","journal-title":"J Mol Struct (Theochem)"},{"key":"394_CR12","doi-asserted-by":"publisher","DOI":"10.1142\/8188","volume-title":"Figurate numbers","author":"E Deza","year":"2012","unstructured":"Deza E, Deza MM (2012) Figurate numbers. World Scientific Publishing, Singapore"},{"key":"394_CR13","volume-title":"Graph theory","author":"R Diestel","year":"2000","unstructured":"Diestel R (2000) Graph theory. Springer, New York"},{"issue":"6","key":"394_CR14","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BF01734359","volume":"17","author":"J Felsenstein","year":"1981","unstructured":"Felsenstein J (1981) Evolutionary trees from DNA sequences: a maximum likelihood approach. J Mol Evol 17(6):368\u2013376","journal-title":"J Mol Evol"},{"issue":"1","key":"394_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01890123","volume":"1","author":"GW Furnas","year":"1984","unstructured":"Furnas GW (1984) The generation of random, binary unordered trees. J Classif 1(1):187\u2013233","journal-title":"J Classif"},{"issue":"7","key":"394_CR16","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/TKDE.2010.173","volume":"23","author":"A Granados","year":"2011","unstructured":"Granados A, Cebrian M, Camacho D, Rodriguez FB (2011) Reducing the loss of information through annealing text distortion. IEEE Trans Knowl Data Eng 23(7):1090\u20131102","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"394_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M Li","year":"1997","unstructured":"Li M, Vit\u00e1nyi PMB (1997) An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, New York","edition":"2"},{"key":"394_CR18","first-page":"1","volume":"2","author":"EM Rains","year":"1999","unstructured":"Rains EM, Sloane NJA (1999) On Cayley\u2019s enumeration of alkanes (or 4-valent trees). J Integer Seq 2:1","journal-title":"J Integer Seq"},{"key":"394_CR19","volume-title":"The encyclopedia of integer sequences","author":"NJA Sloane","year":"1995","unstructured":"Sloane NJA, Plouffe S (1995) The encyclopedia of integer sequences. Academic Press, San Diego"},{"key":"394_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"MA Steel","year":"1992","unstructured":"Steel MA (1992) The complexity of reconstructiong trees from qualitative characters and subtrees. J Classif 9:91\u2013116","journal-title":"J Classif"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0394-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0394-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0394-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T11:49:38Z","timestamp":1576496978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0394-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,27]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["394"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0394-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2018,11,27]]},"assertion":[{"value":"10 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}