Author:
I. Tomohiro,Inenaga Shunsuke,Takeda Masayuki
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Allouche, J.P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theoretical Computer Science 292(1), 9–31 (2003)
2. Anisiu, M.C., Anisiu, V., Kása, Z.: Total palindrome complexity of finite words. Discrete Mathematics 310(1), 109–114 (2010)
3. Baker, B.S.: Parameterized pattern matching: Algorithms and applications. Journal of Computer and System Sciences 52(1), 28–42 (1996)
4. Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. International Journal of Foundations of Computer Science 15(2), 293–306 (2004)
5. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Tech. rep., DIGITAL System Research Center (1994)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithm of Palindrome Detection Tool;Proceedings of the 2023 11th International Conference on Information Technology: IoT and Smart City;2023-12-14
2. Web Service for Palindrome Detection from Algorithm Sequence;2023 27th International Computer Science and Engineering Conference (ICSEC);2023-09-14
3. Position Heaps for Cartesian-Tree Matching on Strings and Tries;String Processing and Information Retrieval;2021
4. Palindromic Subsequence Automata and Longest Common Palindromic Subsequence;Mathematics in Computer Science;2017-02-02
5. On Palindromic Sequence Automata and Applications;Implementation and Application of Automata;2013