The main result of the paper is the first polynomial-time algorithm for ranking bracelets. The
time-complexity of the algorithm is O (k^ 2 n^ 4), where k is the size of the alphabet and n is …