{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:35:48Z","timestamp":1769157348863,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540685487","type":"print"},{"value":"9783540685524","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68552-4_22","type":"book-chapter","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T09:06:43Z","timestamp":1211965603000},"page":"289-302","source":"Crossref","is-referenced-by-count":7,"title":["Exact Algorithms for Cluster Editing: Evaluation and Experiments"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"B\u00f6cker","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Briesemeister","sequence":"additional","affiliation":[]},{"given":"Gunnar W.","family":"Klau","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3-4","key":"22_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A. Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. J. Comput. Biol.\u00a06(3-4), 281\u2013297 (1999)","journal-title":"J. Comput. Biol."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Tru\u00df, A.: A fixed-parameter approach for weighted cluster editing. In: Proc. of Asia-Pacific Bioinformatics Conference (APBC 2008). Series on Advances in Bioinformatics and Computational Biology, vol.\u00a05, pp. 211\u2013220. Imperial College Press (2008)","DOI":"10.1142\/9781848161092_0023"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Tru\u00df, A.: Going weighted: Parameterized algorithms for cluster editing (Manuscript) (2008)","DOI":"10.1016\/j.tcs.2009.05.006"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","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.: Clustering with qualitative information. J. Comput. Syst. Sci.\u00a071(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11847250_2","volume-title":"Parameterized and Exact Computation","author":"F. Dehne","year":"2006","unstructured":"Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: Implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 13\u201324. Springer, Heidelberg (2006)"},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J. Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica\u00a039(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","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.: Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. Theor. Comput. Syst.\u00a038(4), 373\u2013392 (2005)","journal-title":"Theor. Comput. Syst."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01589097","volume":"45","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program.\u00a045, 52\u201396 (1989)","journal-title":"Math. Program."},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-74450-4_4","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"J. Guo","year":"2007","unstructured":"Guo, J.: A more effective linear kernelization for Cluster Editing. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol.\u00a04614, pp. 36\u201347. Springer, Heidelberg (2007)"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10878-005-1861-1","volume":"10","author":"G.A. Kochenberger","year":"2005","unstructured":"Kochenberger, G.A., Glover, F., Alidaee, B., Wang, H.: Clustering of microarray data via clique partitioning. J. Comb. Optim.\u00a010(1), 77\u201392 (2005)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M. K\u0159iv\u00e1nek","year":"1986","unstructured":"K\u0159iv\u00e1nek, M., Mor\u00e1vek, J.: NP-hard problems in hierarchical-tree clustering. Acta Inform.\u00a023(3), 311\u2013323 (1986)","journal-title":"Acta Inform."},{"key":"22_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Tru\u00df, A., B\u00f6cker, S.: Exact and heuristic algorithms for weighted cluster editing. In: Proc. of Computational Systems Bioinformatics (CSB 2007), vol.\u00a06, pp. 391\u2013401 (2007)","DOI":"10.1142\/9781860948732_0040"},{"issue":"1\u20132","key":"22_CR14","doi-asserted-by":"publisher","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.: Cluster graph modification problems. Discrete Appl. Math.\u00a0144(1\u20132), 173\u2013182 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"14","key":"22_CR15","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1093\/bioinformatics\/btg232","volume":"19","author":"R. Sharan","year":"2003","unstructured":"Sharan, R., Maron-Katz, A., Shamir, R.: CLICK and EXPANDER: a system for clustering and visualizing gene expression data. Bioinformatics\u00a019(14), 1787\u20131799 (2003)","journal-title":"Bioinformatics"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/1471-2105-4-41","volume":"4","author":"R.L. Tatusov","year":"2003","unstructured":"Tatusov, R.L., Fedorova, N.D., Jackson, J.D., Jacobs, A.R., Kiryutin, B., Koonin, E.V., Krylov, D.M., Mazumder, R., Mekhedov, S.L., Nikolskaya, A.N., Rao, B.S., Smirnov, S., Sverdlov, A.V., Vasudevan, S., Wolf, Y.I., Yin, J.J., Natale, D.A.: The COG database: an updated version includes eukaryotes. BMC Bioinformatics\u00a04, 41 (2003)","journal-title":"BMC Bioinformatics"},{"key":"22_CR17","series-title":"Lect. Notes Comput. Sc.","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-77918-6_21","volume-title":"Proc. of Workshop on Approximation and Online Algorithms (WAOA 2007)","author":"A. Zuylen van","year":"2008","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Proc. of Workshop on Approximation and Online Algorithms (WAOA 2007). Lect. Notes Comput. Sc., vol.\u00a04927, pp. 260\u2013273. Springer, Heidelberg (2008)"},{"issue":"1","key":"22_CR18","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1186\/1471-2105-8-396","volume":"8","author":"T. Wittkop","year":"2007","unstructured":"Wittkop, T., Baumbach, J., Lobo, F., Rahmann, S.: Large scale clustering of protein sequences with FORCE \u2013 a layout based heuristic for weighted cluster editing. BMC Bioinformatics\u00a08(1), 396 (2007)","journal-title":"BMC Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68552-4_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T12:49:53Z","timestamp":1738241393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68552-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540685487","9783540685524"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68552-4_22","relation":{},"subject":[]}}