{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:57:34Z","timestamp":1768006654962,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,18]],"date-time":"2014-05-18T00:00:00Z","timestamp":1400371200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10878-014-9756-7","type":"journal-article","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T03:33:34Z","timestamp":1400297614000},"page":"347-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Efficient algorithms for cluster editing"],"prefix":"10.1007","volume":"31","author":[{"given":"Lucas","family":"Bastos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan C\u00e9sar","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rian Gabriel S.","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,18]]},"reference":[{"key":"9756_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"RM Aiex","year":"2003","unstructured":"Aiex RM, Binato S, Resende MGC (2003) Parallel grasp with path-relinking for job shop scheduling. Parallel Comput 29:393\u2013430","journal-title":"Parallel Comput"},{"key":"9756_CR2","unstructured":"Bastos LO (2012) Novos algoritmos e resultados te\u00f3ricos para o problema de particionamento de grafos por edi\u00e7\u00e3o de arestas. PhD thesis, Universidade Federal Fluminense (in Portuguese)"},{"key":"9756_CR3","unstructured":"Baumbach J, Emig D, Kleinbolting N, Lange S, Rahmann S, Wittkop T (2014) TransClust. http:\/\/transclust.mmci.uni-saarland.de\/main_page\/index.php, Accessed January 28, 2014"},{"issue":"3\/4","key":"9756_CR4","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor A, Shamir R, Yakhini Z (1999) Clustering gene expression patterns. J Comput Biol 6(3\/4):281\u2013297","journal-title":"J Comput Biol"},{"key":"9756_CR5","first-page":"1","volume":"5165","author":"S B\u00f6cker","year":"2008","unstructured":"B\u00f6cker S, Briesemeister B, A QB, Truss A (2008) Going weighted: parameterized algorithms for cluster editing. Comb Optim Appl 5165:1\u201312","journal-title":"Comb Optim Appl"},{"key":"9756_CR6","unstructured":"B\u00f6cker S, Briesemeister S, Klau G (2009) Exact algorithms for cluster editing: evaluation and experiments. Algorithmica. 1\u201319"},{"key":"9756_CR7","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M Charikar","year":"2005","unstructured":"Charikar M, Guruswami V, Wirth A (2005) Clustering with qualitative information. J Comput Sys Sci 71:360\u2013383","journal-title":"J Comput Sys Sci"},{"key":"9756_CR8","first-page":"13","volume":"4169","author":"F Dehne","year":"2006","unstructured":"Dehne F, Langston MA, Luo X, Pitre S, Shaw P, Zhang Y (2006) The cluster editing problem: implementations and experiments. LNCS 4169:13\u201324","journal-title":"LNCS"},{"key":"9756_CR9","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs i. Publicationes Mathematicae 6:290\u2013297","journal-title":"Publicationes Mathematicae"},{"key":"9756_CR10","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert EN (1959) Random graphs. Ann Math Stat 30:1141\u20131144","journal-title":"Ann Math Stat"},{"key":"9756_CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s00224-004-1178-y","volume":"38","author":"J Gramm","year":"2005","unstructured":"Gramm J, Guo J, H\u00fcffner F, Niedermeier R (2005) Graph-modeled data clustering: exact algorithms for clique generation. Theor Comput Sys 38:373\u2013392","journal-title":"Theor Comput Sys"},{"issue":"1","key":"9756_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel M, Wakabayashi Y (1989) A cutting plane algorithm for a clustering problem. Math Prog 45(1):59\u201396","journal-title":"Math Prog"},{"key":"9756_CR13","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","volume":"410","author":"J Guo","year":"2009","unstructured":"Guo J (2009) A more effective linear kernelization for cluster editing. Theor Comput Sci 410:718\u2013726","journal-title":"Theor Comput Sci"},{"key":"9756_CR14","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovic N (2003) Variable neighborhood search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics, Chap 6, Kluwer Academic Publishers, Philip Drive Norwell, MA, pp 145\u2013183","DOI":"10.1007\/0-306-48056-5_6"},{"issue":"3","key":"9756_CR15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1006\/geno.2000.6187","volume":"66","author":"E Hartuv","year":"2000","unstructured":"Hartuv E, Schmitt AO, Lange J, Meier-Ewert S, Lehrach H, Shamir R (2000) An algorithm for clustering cdna fingerprints. Genomics 66(3):249\u2013256","journal-title":"Genomics"},{"issue":"3","key":"9756_CR16","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264\u2013323","journal-title":"ACM Comput Surv"},{"issue":"3","key":"9756_CR17","doi-asserted-by":"crossref","first-page":"618","DOI":"10.4153\/CJM-1981-050-1","volume":"33","author":"V Klee","year":"1981","unstructured":"Klee V, Larman D (1981) Diameters of random graphs. Can J Math 33(3):618\u2013640","journal-title":"Can J Math"},{"key":"9756_CR18","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2003) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics, Chap 11, Kluwer Academic Publishers, Philip Drive Norwell, MA, pp 321\u2013353","DOI":"10.1007\/0-306-48056-5_11"},{"issue":"1","key":"9756_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/geno.1995.1009","volume":"27","author":"A Milosavljevic","year":"1995","unstructured":"Milosavljevic A, Strezoska Z, Zeremski M, Grujic D, Paunesku T, Crkvenjakov R (1995) Clone clustering by hybridization. Genomics 27(1):83\u201389","journal-title":"Genomics"},{"issue":"2","key":"9756_CR20","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"PHV Penna","year":"2013","unstructured":"Penna PHV, Subramanian A, Ochi LS (2013) An iterated local search heuristic for the heterogeneous fleet vehiclerouting problem. J Heuristics 19(2):201\u2013232","journal-title":"J Heuristics"},{"key":"9756_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00224-007-9032-7","volume":"44","author":"F Protti","year":"2009","unstructured":"Protti F, Silva MD, Szwarcfiter J (2009) Applying modular decomposition to parameterized cluster editing problems. Theory Comput Sys 44:91\u2013104","journal-title":"Theory Comput Sys"},{"key":"9756_CR22","doi-asserted-by":"crossref","unstructured":"Rahmann S, Wittkop T, Baumbach J, Martin M, Truss A, B\u00f6cker S (2007) Exact and heuristic algorithms for weighted cluster editing. In: Markstein P, Xu Y (eds) Comput Sys Bioinforma: CSB 2007 Conference Proceedings of the, Imp. Coll. Press, Covent Garden, London WC2H 9HE, vol 6, pp 391\u2013400.","DOI":"10.1142\/9781860948732_0040"},{"key":"9756_CR23","doi-asserted-by":"crossref","unstructured":"Resende M, Ribeiro C (2003) Greedy randomized adaptive search procedures, Chap 8, Kluwer Academic Publishers, Philip Drive Norwell MA, pp 219\u2013249","DOI":"10.1007\/0-306-48056-5_8"},{"key":"9756_CR24","doi-asserted-by":"crossref","unstructured":"Sen Gupta A, Palit A (1979) On clique generation using boolean equations. In: Proceedings of the IEEE. The IEEE Inc, New York. NY 10017 67:T178\u2013180","DOI":"10.1109\/PROC.1979.11218"},{"key":"9756_CR25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir R, Sharan R, Tsur D (2004) Cluster graph modification problems. Discret Appl Math 144:173\u2013182","journal-title":"Discret Appl Math"},{"issue":"14","key":"9756_CR26","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1093\/bioinformatics\/btg232","volume":"19","author":"R Sharan","year":"2003","unstructured":"Sharan R, Maron-Katz A, Shamir R (2003) Click and expander: a system for clustering and visualizing gene expression data. Bioinforma 19(14):1787\u20131799","journal-title":"Bioinforma"},{"issue":"2","key":"9756_CR27","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1504\/IJLSM.2011.042625","volume":"10","author":"MJF Souza","year":"2011","unstructured":"Souza MJF, Mine MT, de Silva MSA, Ochi LS, Subramanian A (2011) A hybrid heuristic, based on iterated local search and genius, for the vehicle routing problem with simultaneous pickup and delivery. Int J Logist Sys Manag 10(2):142\u2013157","journal-title":"Int J Logist Sys Manag"},{"issue":"1","key":"9756_CR28","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1186\/1471-2105-4-41","volume":"4","author":"R Tatusov","year":"2003","unstructured":"Tatusov R, Fedorova N, Jackson J, Jacobs A, Kiryutin B, Koonin E, Krylov D, Mazumder R, Mekhedov S, Nikolskaya A, Rao BS, Smirnov S, Sverdlov A, Vasudevan S, Wolf Y, Yin J, Natale D (2003) The cog database: an updated version includes eukaryotes. BMC Bioinforma 4(1):41","journal-title":"BMC Bioinforma"},{"key":"9756_CR29","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1186\/1471-2105-8-396","volume":"8","author":"T Wittkop","year":"2007","unstructured":"Wittkop T, Baumbach J, Lobo FP, Rahmann S (2007) Large scale clustering of protein sequences with FORCE: a layout based heuristic for weighted cluster editing. BMC Bioinforma 8:396","journal-title":"BMC Bioinforma"},{"issue":"6","key":"9756_CR30","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1038\/nmeth0610-419","volume":"7","author":"T Wittkop","year":"2010","unstructured":"Wittkop T, Emig D, Lange SJ, Rahmann S, Albrecht M, Morris JH, B\u00f6cker S, Stoye J, Baumbach J (2010) Partitioning biological data with transitivity clustering. Nature Methods 7(6):419\u2013420","journal-title":"Nature Methods"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9756-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9756-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9756-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T06:09:24Z","timestamp":1689228564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9756-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,18]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9756"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9756-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,18]]}}}