Year
2024
Season
Summer
Paper Type
Master's Thesis
College
College of Computing, Engineering & Construction
Degree Name
Master of Science in Computer and Information Sciences (MS)
Department
Computing
NACO controlled Corporate Body
University of North Florida. School of Computing
First Advisor
Dr. Asai Asaithambi
Second Advisor
Dr. Swapnoneel Roy
Third Advisor
Dr. Xudong Liu
Department Chair
Dr. Zornitza Prodanoff
College Dean
William Klostermeyer
Abstract
Challenges in computational biology, such as genome rearrangement, and applications in optical character recognition, like zoning techniques, often require solving optimization problems. These involve reordering scrambled sequences of numbers into a sequential arrangement known as the identity permutation.
Rearranging any given permutation into the identity permutation with the minimum number of specific operations related to strips gives rise to various combinatorial optimization scenarios. Operations such as strip moves, transpositions, reversals, and block interchanges have been extensively researched.
This thesis builds on the foundational work of Roy et al., targeting the refinement of their cycle graph algorithm for sorting by strip swaps. The main contribution of this thesis is the development of a solution that successfully handles the various scenarios of sorting by strip swaps on which the cycle graph algorithm of Roy et al. did not succeed. In order to evaluate our suggested approaches, a brute-force algorithm has been developed to determine the optimal solution and to verify that the cycle graph algorithm is indeed a 2-approximation algorithm. Our experimentation has been confined to small-sized permutations only due to limitations on the resources.
Suggested Citation
Bhakharia, Harsh S., "Implementation of algorithms for sorting by strip swaps using alternating cycle graphs" (2024). UNF Graduate Theses and Dissertations. 1286.
https://digitalcommons.unf.edu/etd/1286