Word assembly through minimal forbidden words

Marinella Sciortino, Antonio Restivo, Gabriele Fici, Gabriele Fici, Filippo Mignosi

Risultato della ricerca: Article

22 Citazioni (Scopus)


We give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.
Lingua originaleEnglish
pagine (da-a)214-230
Numero di pagine17
RivistaTheoretical Computer Science
Stato di pubblicazionePublished - 2006


All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cita questo