The consensus string (or center string, closest string) of a set S of strings is defined as a string which is within a radius r from all strings in S. It is well-known that the consensus string problem for a finite set of equal-length strings is NP-complete. We study the consensus string problem for multiple regular languages. We define the consensus string of languages L1, ⋯, Lk to be within distance at most r to some string in each of the languages L1, ⋯, Lk. We also study the complexity of some parameterized variants of the consensus string problem. For a constant k, we give a polynomial time algorithm for the consensus string problem for k regular languages using additive weighted finite automata. We show that the consensus string problem for multiple regular languages becomes intractable when k is not fixed. We also examine the case when the length of the consensus string is given as part of input.
|Title of host publication||Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings|
|Editors||Frank Drewes, Carlos Martín-Vide, Bianca Truthe|
|Number of pages||12|
|Publication status||Published - 2017|
|Event||11th International Conference on Language and Automata Theory and Applications, LATA 2017 - Umea, Sweden|
Duration: 2017 Mar 6 → 2017 Mar 9
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||11th International Conference on Language and Automata Theory and Applications, LATA 2017|
|Period||17/3/6 → 17/3/9|
Bibliographical notePublisher Copyright:
© Springer International Publishing AG 2017.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)