Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Parallel detection of all palindromes in a string;Apostolico;Theoret. Comput. Sci.,1995
2. Bounds on the complexity of the longest common subsequence problem;Aho;J. ACM,1976
3. L. Bergroth, H. Hakonen, T. Raita, A survey of longest common subsequence algorithms, in: SPIRE 2000, pp. 39–48.
4. M.A. Babenko, T.A. Starikovskaya, Computing longest common substrings via suffix arrays, in: CSR 2008, pp. 64–75.
5. Computing a longest common palindromic subsequence;Chowdhury;Fund. Inform.,2014
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献