An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem
The Journal of Supercomputing
New Processor Array Architectures for the Longest Common Subsequence Problem
The Journal of Supercomputing
A programmable array processor architecture for flexible approximate string matching algorithms
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |