document: A scalable and efficient systolic algorithm for the longest common subsequence problem A longest common subsequence -LRB- LCS -RRB- of two strings is a common subsequence of two strings of maximal length . The LCS problem is that of finding an LCS of two given strings and the length of the LCS . This problem has been the subject of much research because its solution can be applied in many areas . In this paper , a scalable and efficient systolic algorithm is presented . For two given strings of length m and n , where m > or = n , the algorithm can solve the LCS problem in m +2 r-1 -LRB- respectively n +2 r-1 -RRB- time steps with r < n/2 -LRB- respectively r < m/2 -RRB- processors . Experimental results show that the algorithm can be faster on multicomputers than all the previous systolic algorithms for the same problem
doc_bio_tags: O O O O B I O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O
extractive_keyphrases: systolic algorithm longest common subsequence problem
abstractive_keyphrases: scalable algorithm parallel algorithms