Pseudo-repetitions are a natural generalization of the classical notion of repetitions in sequences. We solve fundamental algorithmic questions on pseudo-repetitions by application of insightfulâ€¦ (More)

The paper approaches the classical combinatorial problem of freeness of words, in the more general case of partial words. First, we propose an algorithm that tests efficiently whether a partial wordâ€¦ (More)

The concept of runs, i.e. maximal periodicity or maximal occurrence of repetitions, coined by Iliopoulos et al. [7] when analysing Fibanacci words, has been introduced to represent in a succinctâ€¦ (More)

A well known result of Fraenkel and Simpson states that the number of distinct squares in a word of length n is bounded by 2n since at each position there are at most two distinct squares whose lastâ€¦ (More)

Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realized by sequence alignment techniques, which are computationally expensive. This has led toâ€¦ (More)

This paper approaches the combinatorial problem of Thue freeness for partial words. Partial words are sequences over a finite alphabet that may contain a number of â€•holesâ€–. First, we give an infiniteâ€¦ (More)

We initiate a study of languages of partial words related to regular languages of full words. First, we investigate the possibility of expressing a regular language of full words as the image of aâ€¦ (More)

The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to beâ€¦ (More)