The rank distance is a low-complexity and robust distance between sequences, which has been used in computational linguistics and bioinformatics. We tackle the problem of maximizing rank distances; in particular, we solve the problem of exhibiting sequences at largest rank distance from a given binary sequence.
