Information recovery from randomly mixed-up message text.
We investigate the optimal alignment of two independent random sequences of length . We provide a polynomial lower bound for the probability of the optimal alignment to be macroscopically non-unique. We furthermore establish a connection between the transversal fluctuation and macroscopic non-uniqueness.
Page 1