Inferring strings from runs

Wataru Matsubara, Akira Ishino, Ayumi Shinohara

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

11 Citations (Scopus)

Abstract

A run in a string is a nonextendable periodic substring in the string. Detecting all runs in a string is important and studied both from theoretical and practical points of view. In this paper, we consider the reverse problem of it. We reveal that the time complexity depends on the alphabet size k of the string to be output. We show that it is solvable in polynomial time for both binary alphabet and infinite alphabet, while it is NP-complete for finite k ≥ 4.We also consider a variant of the problem where only a subset of runs are given as an input. We show that it is solvable in polynomial time for infinite alphabet, while it is NP-complete for finite k ≥ 3.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2010
Pages150-160
Number of pages11
Publication statusPublished - 2010 Dec 1
EventPrague Stringology Conference 2010, PSC 2010 - Prague, Czech Republic
Duration: 2010 Aug 302010 Sep 1

Other

OtherPrague Stringology Conference 2010, PSC 2010
Country/TerritoryCzech Republic
CityPrague
Period10/8/3010/9/1

Keywords

  • Inferring problem
  • Repetition
  • Runs

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint

Dive into the research topics of 'Inferring strings from runs'. Together they form a unique fingerprint.

Cite this