Abstract
In this paper, we present a new and efficient algorithm for solving the Longest Common Subsequence (LCS) problem between two run-length-encoded (RLE) strings. Suppose Ŷ and ^X are two RLE strings having length ^k and ^l respectively. Also assume that Y and X are the two uncompressed versions of the two RLE strings Ŷ and ^X having length k and ` respectively. Then, our algorithm runs in O((^k+ ^l)+Rlog log(^k^l)+Rloglogω) time, where ω = k + l and R is the total number of ordered pairs of positions at which the two RLE strings match. Our algorithm outperforms the best algorithms for the same problem in the literature.
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.
