NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES-Reference-Cited by-同舟云学术

NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES

Published:2008-09 Issue:03 Volume:05 Page:351-363
ISSN:0219-8762
Container-title:International Journal of Computational Methods
language:en
Short-container-title:Int. J. Comput. Methods

Author:

ARDILA YOAN JOSÉ PINZÓN¹,CLIFFORD RAPHAËL²,ILIOPOULOS COSTAS S.³,LANDAU GAD M.⁴⁵,MOHAMED MANAL³

Affiliation:

1. Department of System Engineering and Industrial Engineering, National University of Colombia, ALGOS-UN Group, Bogota, Colombia

2. Department of Computer Science, University of Bristol, Bristol, UK

3. Department of Computer Science, King's College London, London, UK

4. Department of Computer Science, Haifa University, Haifa 31905, Israel

5. Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY 11201-3840, USA

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

Publisher

World Scientific Pub Co Pte Lt

Subject

Computational Mathematics,Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219876208001583

Reference10 articles.

1. Generalized String Matching

2. Algorithms For Computing Approximate Repetitions In Musical Sequences

3. NATO Book Series;Clifford R.,2004

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Necklaces, Convolutions, and X+Y;Algorithmica;2012-12-28