An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem
The Journal of Supercomputing
A new flexible algorithm for the longest common subsequence problem
Nordic Journal of Computing
Cache-oblivious dynamic programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient dominant point algorithms for the multiple longest common subsequence (MLCS) problem
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Variants of constrained longest common subsequence
Information Processing Letters
Cache-Oblivious Dynamic Programming for Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Algorithms and theory of computation handbook
Quick-MLCS: a new algorithm for the multiple longest common subsequence problem
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
| Hi-index | 0.00 |