Necklace swap problem for rhythmic similarity measures

Yoan José Pinzó Ardila, Raphaël Clifford, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed

Research output: Contribution to journalArticlepeer-review


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 possible rotations of B. We show that, given the compressed representation of A and B, this distance may be computed in O(k2).

Original languageEnglish
Pages (from-to)351-363
Number of pages13
JournalInternational Journal of Computational Methods
Issue number3
StatePublished - 2008

Bibliographical note

Funding Information:
∗Partially supported by the Israel Science Foundation grant 35/05.


  • Cyclic strings
  • Music retrieval
  • Repeated patterns
  • Rhythmic/melodic similarity
  • Swap distance

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computational Mathematics


Dive into the research topics of 'Necklace swap problem for rhythmic similarity measures'. Together they form a unique fingerprint.

Cite this