TY - GEN
T1 - Approximation algorithm for the cyclic swap problem
AU - Ardila, Yoan José Pinzón
AU - Iliopoulos, Costas S.
AU - Landau, Gad M.
AU - Mohamed, Manal
PY - 2005
Y1 - 2005
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 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.
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 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.
UR - http://www.scopus.com/inward/record.url?scp=78449268975&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:78449268975
SN - 8001033074
SN - 9788001033074
T3 - Proceedings of the Prague Stringology Conference '05
SP - 190
EP - 200
BT - Proceedings of the Prague Stringology Conference '05
T2 - Prague Stringology Conference '05, PSC 2005
Y2 - 29 August 2005 through 31 August 2005
ER -