{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:36:22Z","timestamp":1743100582623,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030158422"},{"type":"electronic","value":"9783030158439"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-15843-9_1","type":"book-chapter","created":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T08:02:38Z","timestamp":1552464158000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Variable Neighbourhood Search Heuristic for Quartet Clustering"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Consoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Korst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steffen","family":"Pauws","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gijs","family":"Geleijnse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,14]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-48481-7_28","volume-title":"Algorithms - ESA\u2019 99","author":"V Berry","year":"1999","unstructured":"Berry, V., Jiang, T., Kearney, P., Li, M., Wareham, T.: Quartet cleaning: improved algorithms and simulations. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 313\u2013324. Springer, Heidelberg (1999). \n                    https:\/\/doi.org\/10.1007\/3-540-48481-7_28"},{"issue":"4","key":"1_CR2","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, P.M.B.: Clustering by compression. IEEE Trans. Inf. Theory 51(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1_CR3","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, P.M.B.: The google similarity distance. IEEE Trans. Knowl. Data Eng. 19(3), 370\u2013383 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"1_CR4","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, P.M.B.: A fast quartet tree heuristic for hierarchical clustering. Pattern Recogn. 44(3), 662\u2013677 (2011)","journal-title":"Pattern Recogn."},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1162\/0148926042728449","volume":"28","author":"R Cilibrasi","year":"2004","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B., de Wolf, R.: Algorithmic clustering of music based on string compression. Comput. Music J. 28(4), 49\u201367 (2004)","journal-title":"Comput. Music J."},{"issue":"10","key":"1_CR6","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.: Heuristic approaches for the quartet method of hierarchical clustering. IEEE Trans. Knowl. Data Eng. 22(10), 1428\u20131443 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR7","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, N.I.: A VNS-based quartet algorithm for biomedical literature clustering. Electron. Notes Discrete Math. 47, 13\u201320 (2015)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1111\/itor.12240","volume":"24","author":"S Consoli","year":"2017","unstructured":"Consoli, S., Stilianakis, N.I.: A quartet method based on variable neighborhood search for biomedical literature extraction and clustering. Int. Trans. Oper. Res. 24(3), 537\u2013558 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ins.2017.06.019","volume":"415\u2013416","author":"LR Costa","year":"2017","unstructured":"Costa, L.R., Aloise, D., Mladenovi\u0107, N.: Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. Inf. Sci. 415\u2013416, 247\u2013253 (2017)","journal-title":"Inf. Sci."},{"key":"1_CR10","volume-title":"Graph Theory","author":"R Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, New York (2000)"},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BF01734359","volume":"17","author":"J Felsenstein","year":"1981","unstructured":"Felsenstein, J.: Evolutionary trees from DNA sequences: a maximum likelihood approach. J. Mol. Evol. 17(6), 368\u2013376 (1981)","journal-title":"J. Mol. Evol."},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01890123","volume":"1","author":"GW Furnas","year":"1984","unstructured":"Furnas, G.W.: The generation of random, binary unordered trees. J. Classif. 1(1), 187\u2013233 (1984)","journal-title":"J. Classif."},{"issue":"7","key":"1_CR13","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, F.B.: Reducing the loss of information through annealing text distortion. IEEE Trans. Knowl. Data Eng. 23(7), 1090\u20131102 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighbourhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"1_CR15","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1137\/S0097539799361683","volume":"30","author":"T Jiang","year":"2000","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 (2000)","journal-title":"SIAM J. Comput."},{"key":"1_CR16","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, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, New York (1997)","edition":"2"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0377-2217(02)00833-0","volume":"151","author":"N Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107, N., Petrovi\u0107, J., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151(2), 389\u2013399 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ins.2015.07.044","volume":"326","author":"N Mladenovi\u0107","year":"2016","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u015bevi\u0107, D.: Less is more: basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326, 160\u2013171 (2016)","journal-title":"Inf. Sci."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"MA Steel","year":"1992","unstructured":"Steel, M.A.: The complexity of reconstructiong trees from qualitative characters and subtrees. J. Classif. 9, 91\u2013116 (1992)","journal-title":"J. Classif."},{"issue":"7","key":"1_CR20","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","volume":"13","author":"K Strimmer","year":"1996","unstructured":"Strimmer, K., von Haeseler, A.: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Mol. Biol. Evol. 13(7), 964\u2013969 (1996)","journal-title":"Mol. Biol. Evol."}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15843-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:05:19Z","timestamp":1558343119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15843-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030158422","9783030158439"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15843-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sithonia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vns2018.uom.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14 submissions were accepted for oral presentation only.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}