Syeda Persia Aziz

Learn More
—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. Supposê Y andˆX are two RLE strings having lengthˆk andˆrespectively. Also assume that Y and X are the two uncompressed versions of the two RLE stringsˆY andˆX having length k and respectively. Then,(More)
  • 1