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.
T. Kociumaka—Supported by Polish budget funds for science in 2013-2017 as a research project under the ‘Diamond Grant’ program.
J. Radoszewski and T. Waleń—Supported by the Polish Ministry of Science and Higher Education under the ‘Iuventus Plus’ program in 2015-2016 grant no 0392/IP3/2015/73.
J. Radoszewski—Receives financial support of Foundation for Polish Science.
W. Rytter—Supported by the Polish National Science Center, grant no 2014/13/B/ST6/00770.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Babenko, M.A., Gawrychowski, P., Kociumaka, T., Starikovskaya, T.: Wavelet trees meet suffix trees. arXiv:1408.6182v4 (2015)
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)
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)
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)
Cole, R., Hariharan, R.: Dynamic LCA queries on trees. SIAM J. Comput. 34(4), 894–923 (2005)
Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)
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)
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)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bannai, H. et al. (2015). Efficient Algorithms for Longest Closed Factor Array. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds) String Processing and Information Retrieval. SPIRE 2015. Lecture Notes in Computer Science(), vol 9309. Springer, Cham. https://doi.org/10.1007/978-3-319-23826-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-23826-5_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23825-8
Online ISBN: 978-3-319-23826-5
eBook Packages: Computer ScienceComputer Science (R0)