On-line Minimum Closed Covers

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.
Type de document :
Communication dans un congrès
Lazaros Iliadis; Ilias Maglogiannis; Harris Papadopoulos; Spyros Sioutas; Christos Makris. 10th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2014, Rhodes, Greece. Springer, IFIP Advances in Information and Communication Technology, AICT-437, pp.106-115, 2014, Artificial Intelligence Applications and Innovations. 〈10.1007/978-3-662-44722-2_12〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01391035
Contributeur : Hal Ifip <>
Soumis le : mercredi 2 novembre 2016 - 17:14:19
Dernière modification le : jeudi 19 avril 2018 - 14:24:03
Document(s) archivé(s) le : vendredi 3 février 2017 - 15:00:48

Fichier

978-3-662-44722-2_12_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Costas Iliopoulos, Manal Mohamed. On-line Minimum Closed Covers. Lazaros Iliadis; Ilias Maglogiannis; Harris Papadopoulos; Spyros Sioutas; Christos Makris. 10th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2014, Rhodes, Greece. Springer, IFIP Advances in Information and Communication Technology, AICT-437, pp.106-115, 2014, Artificial Intelligence Applications and Innovations. 〈10.1007/978-3-662-44722-2_12〉. 〈hal-01391035〉

Partager

Métriques

Consultations de la notice

40

Téléchargements de fichiers

31