Improved Branch And Bound Algorithm For Computing Median Permutation By Block-Interchange
碩士 === 國立清華大學 === 資訊工程學系 === 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, trans...
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 |
Similar Items
Similar Items
-
A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times
by: Mauricio Iwama Takano, et al.
Published: (2017-01-01) -
On the rank-distance median of 3 permutations
by: Leonid Chindelevitch, et al.
Published: (2018-05-01) -
Median Crossover Crashes in the Vicinity of Interchanges on Utah Interstates
by: Winters, Katherine Elaine
Published: (2008) -
Sorting by Bounded Permutations
by: Vergara, John Paul C.
Published: (2014) -
Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms
by: Le Thi Hoai An, et al.
Published: (2014-01-01)