On the efficiency of the hamming C-centerstring problems

Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


The Consensus String Problem is that of finding a string, such that the maximum Hamming distance from it to a given set of strings of the same length is minimized. However, a generalization is necessary for clustering. One needs to consider a partition into a number of sets, each with a distinct centerstring. In this paper we define two natural versions of the consensus problem for c centerstrings. We analyse the hardness and fixed parameter tractability of these problems and provide approximation algorithms.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783319075655
StatePublished - 2014
Event25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014 - Moscow, Russian Federation
Duration: 16 Jun 201418 Jun 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8486 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014
Country/TerritoryRussian Federation


Dive into the research topics of 'On the efficiency of the hamming C-centerstring problems'. Together they form a unique fingerprint.

Cite this