Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract).

In this paper, we provide an O ( n log 2 n log log n log* n ) algorithm to compute a duplication history of a string under no-breakpointreuse condition. Our algorithm is an efficient implementation of earlier work by Zhang et al. (2009). The motivation of this problem stems from computational biology, in particular from analysis of complex gene clusters. The problem is also related to computing edit distance with block operations, but in our scenario the start of the history is not fixed, but chosen to minimize the distance measure.