Author:
Chowdhury Shihabur Rahman,Hasan Md. Mahbubul,Iqbal Sumaiya,Rahman M. Sohel
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Bentley, J.L., Friedman, J.H.: Data structures for range searching. ACM Comput. Surv. 11, 397–409 (1979)
2. Breslauer, D., Galil, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica 14, 355–366 (1995)
3. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York
4. Lecture Notes in Computer Science;P.-H. Hsu,2009
5. Iliopoulos, C., Rahman, M.: A new efficient algorithm for computing the longest common subsequence. Theory of Computing Systems 45, 355–371 (2009)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Longest Common Rollercoasters;String Processing and Information Retrieval;2021
2. On Palindromic Sequence Automata and Applications;Implementation and Application of Automata;2013