Consensus string problem for multiple regular languages

Yo Sub Han, Sang Ki Ko, Timothy Ng, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings
EditorsFrank Drewes, Carlos Martín-Vide, Bianca Truthe
PublisherSpringer Verlag
Pages196-207
Number of pages12
ISBN (Print)9783319537320
DOIs
Publication statusPublished - 2017 Jan 1
Event11th International Conference on Language and Automata Theory and Applications, LATA 2017 - Umea, Sweden
Duration: 2017 Mar 62017 Mar 9

Publication series

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

Other

Other11th International Conference on Language and Automata Theory and Applications, LATA 2017
CountrySweden
City Umea
Period17/3/617/3/9

Fingerprint

Formal languages
Regular Languages
Strings
Finite automata
Polynomials
Weighted Automata
Finite Automata
Polynomial-time Algorithm

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y. S., Ko, S. K., Ng, T., & Salomaa, K. (2017). Consensus string problem for multiple regular languages. In F. Drewes, C. Martín-Vide, & B. Truthe (Eds.), Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings (pp. 196-207). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10168 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-53733-7_14
Han, Yo Sub ; Ko, Sang Ki ; Ng, Timothy ; Salomaa, Kai. / Consensus string problem for multiple regular languages. Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings. editor / Frank Drewes ; Carlos Martín-Vide ; Bianca Truthe. Springer Verlag, 2017. pp. 196-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a636e5cc5c6c43459375866a5964ddf7,
title = "Consensus string problem for multiple regular languages",
abstract = "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.",
author = "Han, {Yo Sub} and Ko, {Sang Ki} and Timothy Ng and Kai Salomaa",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-53733-7_14",
language = "English",
isbn = "9783319537320",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "196--207",
editor = "Frank Drewes and Carlos Mart{\'i}n-Vide and Bianca Truthe",
booktitle = "Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings",
address = "Germany",

}

Han, YS, Ko, SK, Ng, T & Salomaa, K 2017, Consensus string problem for multiple regular languages. in F Drewes, C Martín-Vide & B Truthe (eds), Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10168 LNCS, Springer Verlag, pp. 196-207, 11th International Conference on Language and Automata Theory and Applications, LATA 2017, Umea, Sweden, 17/3/6. https://doi.org/10.1007/978-3-319-53733-7_14

Consensus string problem for multiple regular languages. / Han, Yo Sub; Ko, Sang Ki; Ng, Timothy; Salomaa, Kai.

Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings. ed. / Frank Drewes; Carlos Martín-Vide; Bianca Truthe. Springer Verlag, 2017. p. 196-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10168 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Consensus string problem for multiple regular languages

AU - Han, Yo Sub

AU - Ko, Sang Ki

AU - Ng, Timothy

AU - Salomaa, Kai

PY - 2017/1/1

Y1 - 2017/1/1

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

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

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

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

U2 - 10.1007/978-3-319-53733-7_14

DO - 10.1007/978-3-319-53733-7_14

M3 - Conference contribution

AN - SCOPUS:85013409453

SN - 9783319537320

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

SP - 196

EP - 207

BT - Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings

A2 - Drewes, Frank

A2 - Martín-Vide, Carlos

A2 - Truthe, Bianca

PB - Springer Verlag

ER -

Han YS, Ko SK, Ng T, Salomaa K. Consensus string problem for multiple regular languages. In Drewes F, Martín-Vide C, Truthe B, editors, Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings. Springer Verlag. 2017. p. 196-207. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-53733-7_14