The length of the longest common subsequence (LCS) between two strings of M and N characters can be computed by O(M×N) dynamic programming algorithms that can execute in O(M + N) on a linear systolic array. If the strings are run-length encoded, LCS can be computed by an O(mN +Mn−mn) algorithm, called RLE-LCS, where m and n are the numbers of runs of the two strings. In this paper we propose a modified RLE-LCS algorithm mappable on a linear systolic array.
FPGA-Based Parallel Comparison of Run-Length-Encoded Strings
BOGLIOLO, ALESSANDRO;FRESCHI, VALERIO;
2004
Abstract
The length of the longest common subsequence (LCS) between two strings of M and N characters can be computed by O(M×N) dynamic programming algorithms that can execute in O(M + N) on a linear systolic array. If the strings are run-length encoded, LCS can be computed by an O(mN +Mn−mn) algorithm, called RLE-LCS, where m and n are the numbers of runs of the two strings. In this paper we propose a modified RLE-LCS algorithm mappable on a linear systolic array.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
