On-line Minimum Closed Covers
Résumé
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.
Domaines
Informatique [cs]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...
