Necklace swap problem for rhythmic similarity measures

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

doi:10.1142/S0219876208001583

Necklace swap problem for rhythmic similarity measures

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

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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(k²).

Original language	English
Pages (from-to)	351-363
Number of pages	13
Journal	International Journal of Computational Methods
Volume	5
Issue number	3
DOIs	https://doi.org/10.1142/S0219876208001583
State	Published - 2008

Bibliographical note

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

Keywords

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

ASJC Scopus subject areas

Computer Science (miscellaneous)
Computational Mathematics

Access to Document

10.1142/S0219876208001583

Cite this

@article{d8f3a991b4a045f08178bd32f3de587b,

title = "Necklace swap problem for rhythmic similarity measures",

abstract = "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).",

keywords = "Cyclic strings, Music retrieval, Repeated patterns, Rhythmic/melodic similarity, Swap distance",

author = "Ardila, \{Yoan Jos{\'e} Pinz{\'o}\} and Rapha{\"e}l Clifford and Iliopoulos, \{Costas S.\} and Landau, \{Gad M.\} and Manal Mohamed",

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

year = "2008",

doi = "10.1142/S0219876208001583",

language = "English",

volume = "5",

pages = "351--363",

journal = "International Journal of Computational Methods",

issn = "0219-8762",

publisher = "World Scientific",

number = "3",

}

TY - JOUR

T1 - Necklace swap problem for rhythmic similarity measures

AU - Ardila, Yoan José Pinzó

AU - Clifford, Raphaël

AU - Iliopoulos, Costas S.

AU - Landau, Gad M.

AU - Mohamed, Manal

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

PY - 2008

Y1 - 2008

N2 - 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).

AB - 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).

KW - Cyclic strings

KW - Music retrieval

KW - Repeated patterns

KW - Rhythmic/melodic similarity

KW - Swap distance

UR - https://www.scopus.com/pages/publications/54949102846

U2 - 10.1142/S0219876208001583

DO - 10.1142/S0219876208001583

M3 - Article

AN - SCOPUS:54949102846

SN - 0219-8762

VL - 5

SP - 351

EP - 363

JO - International Journal of Computational Methods

JF - International Journal of Computational Methods

IS - 3

ER -

Necklace swap problem for rhythmic similarity measures

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this