Approximation algorithm for the cyclic swap problem

Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 l'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 into B. minimized over all rotations of B. We show that this distance may be approximated in 0(n + k' 2) time.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference '05
Number of pages11
StatePublished - 2005
EventPrague Stringology Conference '05, PSC 2005 - Prague, Czech Republic
Duration: 29 Aug 200531 Aug 2005

Publication series

NameProceedings of the Prague Stringology Conference '05


ConferencePrague Stringology Conference '05, PSC 2005
Country/TerritoryCzech Republic

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Approximation algorithm for the cyclic swap problem'. Together they form a unique fingerprint.

Cite this