Publication Date
2008
Degree Type
Master's Project
Degree Name
Master of Science (MS)
Department
Computer Science
Abstract
Genome rearrangement is a research area capturing wide attention in molecular biology. The reversal distance problem is one of the most widely studied models of genome rearrangements in inferring the evolutionary relationship between two genomes at chromosome level. The problem of estimating reversal distance between two genomes is modeled as sorting by reversals. While the problem of sorting signed permutations can have polynomial time solutions, the problem of sorting unsigned permutations has been proven to be NP-hard [4]. This work introduces an exact greedy algorithm for sorting by reversals focusing on unsigned permutations. An improved method of producing cycle decompositions for a 3/2-approximation algorithm and the consideration of 3-cycles for reversal sequences are also presented in this paper.
Recommended Citation
Park, Euna, "Exact and Approximation Algorithms for Computing Reversal Distances in Genome Rearrangement" (2008). Master's Projects. 104.
DOI: https://doi.org/10.31979/etd.qm9e-d3gt
https://scholarworks.sjsu.edu/etd_projects/104
