Author:
Adamczyk Michał,Alzamel Mai,Charalampopoulos Panagiotis,Iliopoulos Costas S.,Radoszewski Jakub
Publisher
Springer International Publishing
Reference20 articles.
1. Alatabbi, A., Iliopoulos, C.S., Rahman, M.S.: Maximal palindromic factorization. In: Stringology, pp. 70–77 (2013)
2. Apostolico, A., Breslauer, D., Galil, Z.: Parallel detection of all palindromes in a string. Theor. Comput. Sci. 141(1), 163–173 (1995).
http://dx.doi.org/10.1016/0304-3975(94)00083-U
3. Breslauer, D., Galil, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica 14(4), 355–366 (1995).
http://dx.doi.org/10.1007/BF01294132
4. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)
5. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2003)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Comparing Degenerate Strings;Fundamenta Informaticae;2020-09-28
2. On highly palindromic words: The ternary case;Discrete Applied Mathematics;2020-09
3. Off-line and on-line algorithms for closed string factorization;Theoretical Computer Science;2019-11
4. Palindromic Decompositions with Gaps and Errors;International Journal of Foundations of Computer Science;2018-12
5. Recent Advances of Palindromic Factorization;Lecture Notes in Computer Science;2018