2023/09/21 by Hans Jakob Rivertz, Rivertz, Hans Jakob
Biochemistry, Genetics and Molecular Biology · Engineering · #05A05 #Combinatorics (math.CO) #FOS: Mathematics #G.2.1 #Genome Rearrangement Algorithms #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2309.11781
openalex publication_date 2023/09/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper proposes a new algorithm for generating all permutations of multisets. The method uses transpositions only and adjacent transpositions are favoured. The algorithm requires a strong homogeneous transposition condition: non-adjacent transpositions are allowed only if all elements between the two permuted elements are equal to the smallest of those two elements. The storage required by the algorithm is small.