Abstract
The Cluster Editing problem asks to transform a graph into a disjoint union of cliques using a minimum number of edge modifications. Although the problem has been proven NP-complete several times, it has nevertheless attracted much research both from the theoretical and the applied side. The problem has been the inspiration for numerous algorithms in bioinformatics, aiming at clustering entities such as genes, proteins, phenotypes, or patients. In this paper, we review exact and heuristic methods that have been proposed for the Cluster Editing problem, and also applications of these algorithms for biological problems. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Böcker, S., & Baumbach, J. (2013). Cluster editing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7921 LNCS, pp. 33–44). https://doi.org/10.1007/978-3-642-39053-1_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
