Necklace swap problem for rhythmic similarity measures

Authors:
Yoan José Pinzón Ardila;Raphaël Clifford;Manal Mohamed
Affiliations:
Department of Computer Science, King's College London, London, UK;Department of Computer Science, University of Bristol, UK;Department of Computer Science, King's College London, London, UK
Venue:
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Year:
2005

Citing 5
Cited 1

Generalized string matching

SIAM Journal on Computing
Query by humming: musical information retrieval in an audio database

Proceedings of the third ACM international conference on Multimedia
A Melody-Based Similarity Computation Algorithm for Musical Information

KDEX '99 Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange
Approximate string matching for music analysis

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Faster algorithms for δ,γ-matching and related problems

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

Computational geometric aspects of rhythm, melody, and voice-leading

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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 rotations of B. We show that this distance may be computed in O(k2).