Necklace Swap Problem for Rhythmic Similarity Measures

Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing the cyclic swap distance between A and B, i.e., the minimum number of swaps needed to convert A to B, minimized over all rotations of B. We show that this distance may be computed in O(k2 ).

• Type: Conference
• Year: 2005
• Where: SPIRE
• Authors: Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed
• Keywords: Binary Strings, Cyclic Swap Distance, Necklace Instances, SPIRE 2005