A syntactic approach for searching similarities within sentences
Proceedings of the eleventh international conference on Information and knowledge management
A new flexible algorithm for the longest common subsequence problem
Nordic Journal of Computing
An all-substrings common subsequence algorithm
Discrete Applied Mathematics
A space efficient algorithm for the constrained heaviest common subsequence problem
Proceedings of the 46th Annual Southeast Regional Conference on XX
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 |