On the efficiency of the hamming C-centerstring problems

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

doi:10.1007/978-3-319-07566-2_1

On the efficiency of the hamming C-centerstring problems

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

Department of Computer Science

Johns Hopkins University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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.

Original language	English
Title of host publication	Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings
Publisher	Springer Verlag
Pages	1-10
Number of pages	10
ISBN (Print)	9783319075655
DOIs	https://doi.org/10.1007/978-3-319-07566-2_1
State	Published - 2014
Event	25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014 - Moscow, Russian Federation Duration: 16 Jun 2014 → 18 Jun 2014

Publication series

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

Conference

Conference	25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014
Country/Territory	Russian Federation
City	Moscow
Period	16/06/14 → 18/06/14

Access to Document

10.1007/978-3-319-07566-2_1

Cite this

Amir, A., Ficler, J., Roditty, L., & Shalom, O. S. (2014). On the efficiency of the hamming C-centerstring problems. In Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings (pp. 1-10). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8486 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-07566-2_1

@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",

}

Amir, A, Ficler, J, Roditty, L & Shalom, OS 2014, On the efficiency of the hamming C-centerstring problems. in Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8486 LNCS, Springer Verlag, pp. 1-10, 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, Moscow, Russian Federation, 16/06/14. https://doi.org/10.1007/978-3-319-07566-2_1

On the efficiency of the hamming C-centerstring problems. / Amir, Amihood; Ficler, Jessica; Roditty, Liam et al.
Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings. Springer Verlag, 2014. p. 1-10 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8486 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the efficiency of the hamming C-centerstring problems

AU - Amir, Amihood

AU - Ficler, Jessica

AU - Roditty, Liam

AU - Shalom, Oren Sar

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958534543&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-07566-2_1

DO - 10.1007/978-3-319-07566-2_1

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84958534543

SN - 9783319075655

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 10

BT - Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings

PB - Springer Verlag

T2 - 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014

Y2 - 16 June 2014 through 18 June 2014

ER -

Amir A, Ficler J, Roditty L, Shalom OS. On the efficiency of the hamming C-centerstring problems. In Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings. Springer Verlag. 2014. p. 1-10. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-07566-2_1

On the efficiency of the hamming C-centerstring problems

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this