On Abelian Longest Common Factor with and without RLE
On Abelian Longest Common Factor with and without RLE
We consider the Abelian longest common factor problem in two scenarios: when input strings are uncompressed and are of length at most n, and when the input strings are run-length encoded and their compressed representations have size at most m. The alphabet size is denoted by σ. For the uncompresse …