Advertisement
Published in:
2005 | OriginalPaper | Chapter
Necklace Swap Problem for Rhythmic Similarity Measures
Authors : Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed
Published in: String Processing and Information Retrieval
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
(
k
2
).