Reduced bd-anchors: One issue with bd-anchors is that they are not very stable when the minimal rotation starts close to the end of the string. Ayad, Loukides, and Pissis (2023) presents an average-case \(O(n)\) linear time construction algorithm for \(r=4\log_\sigma(\ell)\) reduced bd-anchors based on minimizers: A $r$-reduced bd-anchor is an \(k=r+1\) lexicographic minimizer. W.h.p., the minimizer is also the reduced bd-anchor, so simply (over-) report the set of minimizers as bd-anchors.