Salta al contenuto principale
Passa alla visualizzazione normale.

MARINELLA SCIORTINO

Word assembly through minimal forbidden words

  • Autori: FICI G; MIGNOSI F; RESTIVO A; SCIORTINO M
  • Anno di pubblicazione: 2006
  • Tipologia: Articolo in rivista (Articolo in rivista)
  • OA Link: http://hdl.handle.net/10447/11127

Abstract

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.