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.
Chapter PDF
Similar content being viewed by others
References
Alstrup, S., Holm, J.: Improved Algorithms for Finding Level Ancestors in Dynamic Trees. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 73–84. Springer, Heidelberg (2000)
Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal Superprimitivity Testing for Strings. Inform. Processing Letter 39, 17–20 (1991)
Badkobeh, G., Bannai, H., Goto, K.: I, Tomohiro, Iliopoulos, C. S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed Factorization (to appear)
Badkobeh, G., Fici, G., Lipták, Z.: A Note on Words With the Smallest Number of Closed Factors. CoRR abs/1305.6395 (2013)
Breslauer, D.: An On-Line String Superprimitivity Test. Information Processing Letters 44, 345–347 (1992)
Bucci, M., de Luca, A., De Luca, A.: Rich and Periodic-Like Words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 145–155. Springer, Heidelberg (2009)
Carpi, A., de Luca, A.: Periodic-Like Words, Periodicity and Boxes. Acta Informatica 37, 597–618 (2001)
Crochemore, M., Ilie, L.: Computing Longest Previous Factor in Linear Time and Applications. Inf. Process. Lett. 106(2), 75–80 (2008)
Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Walen, T.: Computing the Longest Previous Factor. Eur. J. Comb. 34(1), 15–26 (2013)
Fici, G.: A Classification of Trapezoidal Words. In: Ambroz, P., Holub, S., Masakova, Z. (eds.) 8th International Conference on Words, WORDS 2011. Electronic Proceedings in Theoretical Computer Science, vol. 63, pp. 129–137 (2011)
Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic Richness. European J. Combin. 30, 510–531 (2009)
Guo, Q., Zhang, H., Iliopoulos, C.S.: Computing the λ-Covers of a String. Inf. Sci. 177(19), 3957–3967 (2007)
Iliopoulos, C.S., Mohamed, M., Smyth, W.F.: New Complexity Results for the k-Covers Problem. International Journal of Information Sciences 181, 2571–2575 (2011)
Iliopoulos, C.S., Mouchard, L.: An O(nlogn) Algorithm for Computing All Maximal Quasiperiodicities in Strings. Theoratical Computer Science 119, 247–265 (1993)
Iliopoulos, C.S., Smyth, W.F.: On-Line Algorithms for k-Covering. In: Proc. Ninth Australasian Workshop on Combinatorial Algorithms, pp. 107–116 (1998)
Kärkkäinen, J., Sanders, P.: Simpler Linear Work Suffix Array Construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943–955. Springer, Heidelberg (2003)
Kim, D.-K., Sim, J.S., Park, H.-J., Park, K.: Linear-Time Construction of Suffix Arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 186–199. Springer, Heidelberg (2003)
Ko, P., Aluru, S.: Space Efficient Linear Time Construction of Suffix Arrays. Journal of Discrete Algorithms 3(24), 143–156 (2005)
Li, Y., Smyth, W.F.: Computing the Cover Array in Linear Time. Algorithmica 32, 95–106 (2002)
Main, M.G., Lorentz, R.J.: An O(nlogn) Algorithm for Finding All Repetitions in a String. J. Algs. 5, 422–432 (1984)
Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line Search. SIAM J. on Computing, 935–948 (1993)
Moore, D., Smyth, W.F.: An Optimal Algorithm to Compute All the Covers of a String. Information Processing Letters 50, 239–246 (1994)
Thue, A.: Über Unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana 7, 1–22 (1906)
Tomohiro, I., Sugimoto, S., Inenaga, S., Bannai, H., Takeda, M.: Computing palindromic factorizations and palindromic covers on-line. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 150–161. Springer, Heidelberg (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Iliopoulos, C.S., Mohamed, M. (2014). On-line Minimum Closed Covers. In: Iliadis, L., Maglogiannis, I., Papadopoulos, H., Sioutas, S., Makris, C. (eds) Artificial Intelligence Applications and Innovations. AIAI 2014. IFIP Advances in Information and Communication Technology, vol 437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44722-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-44722-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44721-5
Online ISBN: 978-3-662-44722-2
eBook Packages: Computer ScienceComputer Science (R0)