Analysis of genome rearrangements in multiple genomes corresponds to following Multiple Breakpoint Distance problem:
Given set of permutations p1, . . . , pk, determine ancestral permutation such that ∑br(pi, p) is minimal, where br(pi, p) is number of breakpoints between pi and p. Create greedy algorithm for Multiple Breakpoint Distance problem and estimate its approximation ratio.