that each string si has a consecutive substring of length L whose distance is at most d from s. The problem is moti- vated by applications in computational ...
確定！ 回上一頁
