Combinatorial queries and updates on partial words

Authors:
Adrian Diaconu;Florin Manea;Cătălin Tiseanu
Affiliations:
Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania;Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania;Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania
Venue:
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Year:
2009

Citing 14
Cited 4

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Partial words and a theorem of Fine and Wilf

Theoretical Computer Science
Partial words and a theorem of Fine and Wilf revisited

Theoretical Computer Science
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Partial words and the critical factorization theorem

Journal of Combinatorial Theory Series A
Testing primitivity on partial words

Discrete Applied Mathematics
Freeness of partial words

Theoretical Computer Science
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)

Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Square-free partial words

Information Processing Letters
A generalization of Thue freeness for partial words

Theoretical Computer Science
Overlap-freeness in infinite partial words

Theoretical Computer Science
Primitive partial words

Discrete Applied Mathematics

Bounded hairpin completion

Information and Computation
Periodicity algorithms for partial words

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Hard counting problems for partial words

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
The hardness of counting full words compatible with partial words

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we define four combinatorial queries on partial words, asking if a factor of a partial word is a k-repetition, k-free, overlap-free, and primitive, respectively. We show how a given partial word can be preprocessed efficiently in order to answer each of these queries in constant time. Also, we define an update operation for partial words: add a new symbol at the rightmost end of a given partial word; further, we show that the data structures obtained during the preprocessing mentioned above can be updated efficiently in order to still be able to answer all the combinatorial queries, for the updated word, in constant time.