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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
