A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum

Abstract

We investigate the problem of determining the basis of motifs (a form of repeated patterns with don't cares) in an input string. We give new upper and lower bounds on the problem, introducing a new notion of basis that is provably smaller than (and contained in) previously defined ones. Our basis can be computed in less time and space, and is still able to generate the same set of motifs. We also prove that the number of motifs in all these bases grows exponentially with the quorum, the minimal number of times a motif must appear. We show that a polynomial-time algorithm exists only for fixed quorum.
Fichier principal
Vignette du fichier
tiling.pdf (279.08 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00620116 , version 1 (26-03-2013)

Identifiers

Cite

Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot. A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. International Symposium on Mathematical Foundations of Computer Science 2003, Aug 2003, Bratislava, Slovakia. pp.622-632, ⟨10.1007/978-3-540-45138-9_56⟩. ⟨hal-00620116⟩
197 View
140 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More