The longest run subsequence problem: Further complexity results