Lexicographically minimal string rotation

In computer science, the lexicographically minimal string rotation (LMSR) or lexicographically least circular substring is the problem of finding the rotation of a string possessing the lowest lexicographical order of all such rotations. For example, the lexicographically minimal rotation of "bbaaccaadd" would be "aaccaaddbb".