Advertisement

International Symposium on String Processing and Information Retrieval

SPIRE 2015: String Processing and Information Retrieval pp 95-102 | Cite as

Efficient Algorithms for Longest Closed Factor Array

  • Hideo Bannai
  • Shunsuke Inenaga
  • Tomasz Kociumaka
  • Arnaud Lefebvre
  • Jakub Radoszewski
  • Wojciech Rytter
  • Shiho Sugimoto
  • Tomasz Waleń
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9309)

Abstract

We consider a family of strings called closed strings and a related array of Longest Closed Factors (LCF). We show that the reconstruction of a string from its LCF array is easier than the construction and verification of this array. Moreover, the reconstructed string is unique. We improve also the time of construction/verification, reducing it from \(\mathcal {O}(n \log n/\log \log n)\) (the best previously known) to \(\mathcal {O}(n\sqrt{\log n})\). We use connections between the LCF array and the longest previous/next factor arrays.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Babenko, M.A., Gawrychowski, P., Kociumaka, T., Starikovskaya, T.: Wavelet trees meet suffix trees. arXiv:1408.6182v4 (2015)
  2. 2.
    Badkobeh, G., Bannai, H., Goto, K., Tomohiro, I., Iliopoulos, C.S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed factorization. In: Holub, J., Žd’árek, J. (eds.) Prague Stringology Conference 2014, pp. 162–168 (2014)Google Scholar
  3. 3.
    Badkobeh, G., Fici, G., Lipták, Z.: On the number of closed factors in a word. In: Dediu, A.-H., Formenti, E., Martín-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 381–390. Springer, Heidelberg (2015) Google Scholar
  4. 4.
    Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.I.: The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40, 31–55 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Cole, R., Hariharan, R.: Dynamic LCA queries on trees. SIAM J. Comput. 34(4), 894–923 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007) CrossRefzbMATHGoogle Scholar
  7. 7.
    Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Waleń, T.: Computing the longest previous factor. Eur. J. of Comb. 34(1), 15–26 (2013)CrossRefzbMATHGoogle Scholar
  8. 8.
    Fici, G.: A classification of trapezoidal words. In: Ambroz, P., Holub, S., Masáková, Z. (eds.) Combinatorics on Words - WORDS 2011. EPTCS, vol. 63, pp. 129–137 (2011)Google Scholar
  9. 9.
    Fischer, J., Gawrychowski, P.: Alphabet-dependent string searching with wexponential search trees. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 160–171. Springer, Heidelberg (2015) CrossRefGoogle Scholar
  10. 10.
    De Luca, A., Fici, G.: Open and closed prefixes of Sturmian words. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 132–142. Springer, Heidelberg (2013) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Hideo Bannai
    • 1
  • Shunsuke Inenaga
    • 1
  • Tomasz Kociumaka
    • 2
  • Arnaud Lefebvre
    • 3
  • Jakub Radoszewski
    • 2
  • Wojciech Rytter
    • 2
  • Shiho Sugimoto
    • 1
  • Tomasz Waleń
    • 2
  1. 1.Department of Informatics, Graduate School of Information Science and Electrical EngineeringKyushu UniversityFukuokaJapan
  2. 2.Faculty of Mathematics, Informatics and MechanicsUniversity of WarsawWarsawPoland
  3. 3.Normandie Université, LITIS EA4108, NormaStic CNRS FR 3638, IRIB, Université de RouenMont-saint-aignan CedexFrance

Personalised recommendations