Improved Branch And Bound Algorithm For Computing Median Permutation By Block-Interchange

• Main Authors: Cherng-Yuh Chang, 張成鈺
• Other Authors: Chuan-Yi Tang
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/95574318422885015567

碩士 === 國立清華大學 === 資訊工程學系 === 93 === Abstract DNA, RNA and protein sequences have helped us to understand the evolutionary relationship between organisms. There are various operations in genome rearrangement problem, including insertions, deletions, substitutions, reversals, transpositions, translocations, transreversals, fissions, fusions, and block-interchange. Dobzhansky and Sturtevant [10] first proposed that degree to gene orders differ between species could be useful to phylogenetic inference in 1938. One of the important problems is median problem. The inversion median was proved NP-Complete problem, as to block-interchange median is a NP-Complete is still open. We use the same branch-and-bound architecture proposed by Adam C. Siepel et al. and improve it to solve the block-interchange median with the two properties associated with cycle-graph and common breakpoints. We get a better result with improved branch-and-bound algorithm than pure branch-and-bound architecture algorithm in dealing with block-interchange median problem.