Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 106-115 |
| Number of pages | 10 |
| Journal | Advances In Digital Forensics V |
| Volume | 437 |
| Publication status | Published - 2014 |
Keywords
- Algorithm
- Closed String
- Cover
- String