 |
HAL UPEC - UPEM Portal |  |
 |
Conference papers
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.
https://hal-upec-upem.archives-ouvertes.fr/hal-00620116
Contributor : Maxime Crochemore <>
Submitted on : Tuesday, March 26, 2013 - 7:50:48 AM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Document(s) archivé(s) le : Thursday, June 27, 2013 - 2:55:11 AM
Contributor : Maxime Crochemore <>
Submitted on : Tuesday, March 26, 2013 - 7:50:48 AM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Document(s) archivé(s) le : Thursday, June 27, 2013 - 2:55:11 AM
File
tiling.pdf
Files produced by the author(s)
