We introduce approximate trace reconstruction, a relaxed version of the trace reconstruction problem. Here, instead of learning a binary string perfectly from noisy samples, as in the original trace ...

A circular string, which is made by connecting the first and the last symbol of a string, is one of simple sequence forms and is used for many applications such as data compression and fragment ...

The algorithm is described in A Fast String Searching Algorithm, with R.S. Boyer. Communications of the Association for Computing Machinery, 20(10), 1977, pp. 762-772. The classic Boyer-Moore ...