A CFSG-free diameter bound for permutation subgroups

Helfgott and Seress have proved the existence of a quasipolynomial upper bound on the diameter of transitive permutation subgroups. In this paper we remove the dependence on CFSG from that result, by using the algorithm solving the string isomorphism problem (due to Babai) in its CFSG-free version (due to Babai and Pyber).