Partitioning into colorful components by minimum edge deletions

Authors:
Sharon Bruckner;Falk Hüffner;Christian Komusiewicz;Rolf Niedermeier;Sven Thiel;Johannes Uhlmann
Affiliations:
Institut für Mathematik, Freie Universität Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Germany
Venue:
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Year:
2012

Citing 10
Cited 0

Invitation to data reduction and problem kernelization

ACM SIGACT News
The multi-multiway cut problem

Theoretical Computer Science
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Multiple Alignment of Biological Networks: A Flexible Approach

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Going weighted: Parameterized algorithms for cluster editing

Theoretical Computer Science
A min-cut algorithm for the consistency problem in multiple sequence alignment

Bioinformatics
Clustering with diversity

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Multicut is FPT

Proceedings of the forty-third annual ACM symposium on Theory of computing
Fixed-parameter tractability of multicut parameterized by the size of the cutset

Proceedings of the forty-third annual ACM symposium on Theory of computing
On making directed graphs transitive

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The NP-hard Colorful Components problem is, given a vertex-colored graph, to delete a minimum number of edges such that no connected component contains two vertices of the same color. It has applications in multiple sequence alignment and in multiple network alignment where the colors correspond to species. We initiate a systematic complexity-theoretic study of Colorful Components by presenting NP-hardness as well as fixed-parameter tractability results for different variants of Colorful Components. We also perform experiments with our algorithms and additionally develop an efficient and very accurate heuristic algorithm clearly outperforming a previous min-cut-based heuristic on multiple sequence alignment data.