We consider the problem of reconstructing an $n$-sequence, given the multiplicities with which $k$-sequences occur as subsequences. We improve the lower bound on $k$ from $\Omega(\log n)$ to $\exp(\Omega(\log^{1/2} n))$.