Abstract
Purchase PDF (209 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (530 K)
doi:10.1016/j.ins.2006.07.024 
Copyright © 2006 Elsevier Inc. All rights reserved.
Parallel comparison of run-length-encoded strings on a linear systolic array
Received 20 July 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The length of the longest common subsequence (LCS) between two strings of M and N characters can be computed by an O(M × N) dynamic programming algorithm, that can be executed in O(M + N) steps by a linear systolic array. It has been recently shown that the LCS between run-length-encoded (RLE) strings of m and n runs can be computed by an O(nM + Nm − nm) algorithm that could be executed in O(m + n) steps by a parallel hardware. However, the algorithm cannot be directly mapped on a linear systolic array because of its irregular structure.
In this paper, we propose a modified algorithm that exhibits a more regular structure at the cost of a marginal reduction of the efficiency of RLE. We outline the algorithm and we discuss its mapping on a linear systolic array.
Keywords: Algorithms; Longest common subsequence; Run-length encoding; Systolic array; String comparison
