The Minimum Closed Covers problem asks us to compute a minimum size of a closed cover of given string. In this paper we present an on-line O(n)-time algorithm to calculate the size of a minimum closed cover for each prefix of a given string w of length n. We also show a method to recover a minimum closed cover of each prefix of w in greedy manner from right to left.
CITATION STYLE
Iliopoulos, C. S., & Mohamed, M. (2014). On-line minimum closed covers. IFIP Advances in Information and Communication Technology, 437, 106–115. https://doi.org/10.1007/978-3-662-44722-2_12
Mendeley helps you to discover research relevant for your work.