String-matching on ordered alphabets
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Handbook of formal languages, vol. 1
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Local periods and binary partial words: an algorithm
Theoretical Computer Science
Testing primitivity on partial words
Discrete Applied Mathematics
Simple deterministic wildcard matching
Information Processing Letters
Theoretical Computer Science
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Combinatorial queries and updates on partial words
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
DNA'04 Proceedings of the 10th international conference on DNA computing
Periodicity algorithms and a conjecture on overlaps in partial words
Theoretical Computer Science
The hardness of counting full words compatible with partial words
Journal of Computer and System Sciences
Hi-index | 0.00 |
In this paper we investigate several periodicity-related algorithms for partial words. First, we show that all periods of a partial word of length n are determined in O(n log n) time, and provide algorithms and data structures that help us answer in constant time queries regarding the periodicity of their factors. For this we need a O(n2) preprocessing time and a O(n) updating time, whenever the words are extended by adding a letter. In the second part we show that substituting letters of a word w with holes, with the property that no two holes are too close to each other, to make it periodic can be done in optimal time O(|w|). Moreover, we show that inserting the minimum number of holes such that the word keeps the property can be done as fast.