Publisher
Springer Nature Switzerland
Reference35 articles.
1. Alzamel, M., et al.: Finding the anticover of a string. In: 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), vol. 161 (2020)
2. Lecture Notes in Computer Science;M Alzamel,2019
3. Amir, A., Levy, A., Lubin, R., Porat, E.: Approximate cover of strings. Theor. Comput. Sci. 793, 59–69 (2019). https://doi.org/10.1016/j.tcs.2019.05.020
4. Apostolico, A., Crochemore, M.: Fast parallel Lyndon factorization with applications. Math. Syst. Theor. 28(2), 89–108 (1995). https://doi.org/10.1007/BF01191471
5. Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theor. Comput. Sci. 119(2), 247–265 (1993)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. String Covering: A Survey;Fundamenta Informaticae;2023-10-27