Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Diverse palindromic factorization is np-complete;Bannai,2015
2. The LCA problem revisited;Bender,2000
3. Palindromic length in linear time;Borozdin,2017
4. Computing longest previous factor in linear time and applications;Crochemore;Inf. Process. Lett.,2008
5. Episturmian words and some constructions of de Luca and Rauzy;Droubay;Theor. Comput. Sci.,2001
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献