TY - GEN
T1 - Combinatorial queries and updates on partial words
AU - Diaconu, Adrian
AU - Manea, Florin
AU - Tiseanu, Cǎtǎlin
PY - 2009/11/9
Y1 - 2009/11/9
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70350656211&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350656211&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-03409-1_10
DO - 10.1007/978-3-642-03409-1_10
M3 - Conference contribution
AN - SCOPUS:70350656211
SN - 364203408X
SN - 9783642034084
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 96
EP - 108
BT - Fundamentals of Computation Theory - 17th International Symposium, FCT 2009, Proceedings
T2 - 17th International Symposium on Fundamentals of Computation Theory, FCT 2009
Y2 - 2 September 2009 through 4 September 2009
ER -