Beyond the Longest Letter-duplicated Subsequence Problem

Wenfeng Lai, Adiesha Liyanage, Binhai Zhu +1

Given a sequence $S$ of length $n$, a letter-duplicated subsequence is a subsequence of $S$ in the form of $x_1^{d_1}{x}_2^{d_2}\cdots x_k^{d_k}$ with $x_i\in \Sigma$, $x_j\ne x_{j+1}$ an…