A new flexible algorithm for the longest common subsequence problem
Nordic Journal of Computing
Efficient Computation of All Longest Common Subsequences
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Fast Algorithms for Computing Tree LCS
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Fast algorithms for computing tree LCS
Theoretical Computer Science
Efficient dominant point algorithms for the multiple longest common subsequence (MLCS) problem
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Utilizing dynamically updated estimates in solving the longest common subsequence problem
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
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 |