Dynamic programming algorithms for the mosaic longest common subsequence problem