Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference9 articles.
1. Bounds on the complexity of the longest common subsequence problem;Aho;J. Assoc. Comput. Mach.,1976
2. Parameterized complexity analysis in computational biology;Bodlaender;CABIOS,1995
3. The parameterized complexity of sequence alignment and consensus;Bodlaender;Theoret. Comput. Sci.,1994
4. Parameterized Complexity, Monographs in Computer Science;Downey,1999
5. K. Hakata, H. Imai, The longest common subsequence problem for small alphabet size between many strings. Proceedings of the third Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 670, Springer, Berlin, 1992.
Cited by
110 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献