@inproceedings{8bbb2cc1b8eb45519a55b1b18c6d96c5,

title = "On the efficiency of the hamming C-centerstring problems",

abstract = "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.",

author = "Amihood Amir and Jessica Ficler and Liam Roditty and Shalom, {Oren Sar}",

year = "2014",

doi = "10.1007/978-3-319-07566-2_1",

language = "אנגלית",

isbn = "9783319075655",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--10",

booktitle = "Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings",

address = "גרמניה",

note = "25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014 ; Conference date: 16-06-2014 Through 18-06-2014",

}