Computing repetitive structures in indeterminate strings

@inproceedings{Antoniou2008ComputingRS,
  title={Computing repetitive structures in indeterminate strings},
  author={Pavlos Antoniou and Costas S. Iliopoulos and Inuka Jayasekera and Wojciech Rytter},
  year={2008}
}
We study the problem of finding local and global covers and repetitive structures called seeds in indeterminate strings. An indeterminate string is a sequence X̃ = X̃[1]X̃ [2] . . . X̃[n], where X̃[i] ⊆ Σ for each i, and Σ is a given alphabet of fixed size. We present an algorithm for finding the smallest cover of the string x in O(nlogn) time, where n is the length of the string n. Then we extend this algorithm to find all the local and global covers of the string x and we extend the latter to… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…