Considering Adelman's Shortest Permutation Strings
arXiv:1009.5053
Abstract
In this report, we consider Adelman's algorithm for generating shortest permutation strings. We introduce a new representation approach which reveals some properties of Adelman's algorithm.