1. Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comput. Biol. 8(5), 483–491 (2001)
2. Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. In: Proceedings of the 34th Annual Symposium on Foundations of Computer Science (FOCS 1993), pp. 148–157. IEEE Computer Society (1993)
3. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discret. Math. 11(2), 224–240 (1998)
4. Bass, D.W., Sudborough, I.H.: On the shuffle-exchange permutation network. In: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN 1997), pp. 165–171. IEEE (1997)
5. Lecture Notes in Computer Science;C Boucher,2021