Longest common subsequence problem for run-length-encoded strings

@article{Ahsan2012LongestCS,
  title={Longest common subsequence problem for run-length-encoded strings},
  author={Shegufta Bakht Ahsan and Syeda Persia Aziz and Mohammad Sohel Rahman},
  journal={2012 15th International Conference on Computer and Information Technology (ICCIT)},
  year={2012},
  pages={36-41}
}
In this paper, we present a new and efficient algorithm for solving the longest common subsequence problem between two run-length-encoded (RLE) strings. Suppose Ŷ 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 Ŷ and X having length k and ℓ respectively. Then, our algorithm runs in O((k + ℓ)+R loglog(kℓ) + R log log ω) time, where ω = k + ℓ and R is the total number of ordered pairs of positions at… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Matching for Run-Length Encoded Strings

View 7 Excerpts
Highly Influenced

Improved tools for biological sequence comparison.

Proceedings of the National Academy of Sciences of the United States of America • 1988
View 2 Excerpts
Highly Influenced