Algorithms for multiple genome rearrangement by signed reversals.
We discuss a multiple genome rearrangement problem by signed reversals: Given a collection of genomes, we generate them in the minimum number of signed reversals. It is NP-hard and equivalent to finding an optimal Steiner tree to connect the genomes by reversal paths. We design two algorithms to find the optimal Steiner nodes of the problem: Neighbor-perturbing algorithm and branch-and-bound algorithm. The first one is a polynomial running time approximation algorithm. It searches for the optimal Steiner nodes by perturbing initial Steiner nodes nearby their neighborhoods and improving them better and better until convergence. The second one is an exact exponential running time algorithm for a median problem. It finds the optimal Steiner node by checking all candidates that satisfy the necessary conditions for optimal Steiner nodes. We implement the algorithms into two programs respectively and show by experimental examples that they are more efficient than other similar ones, such as GRAPPA, BPAnalysis, and MGR, etc.
Wu
Shiquan
S
Center of Bioinformatics and Biological Statistics, Iowa State University, Ames, IA 50011, USA. sqwu@cs.iastate.edu
Gu
Xun
X
D000465:Algorithms; D015321:Gene Rearrangement; D023281:Genomics / Q000706:statistics & numerical data*; D008433:Mathematics; D008957:Models, Genetic; D010802:Phylogeny; D012984:Software