A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates
Rearrangements are large-scale mutations in genomes, responsible for complex changes and structural variations. Most rearrangements that modify the organization of a genome can be represented by the double cut and join (DCJ) operation. Given two genomes with the same content, so that we have exactly the same number of copies of each gene in each genome, we are interested in the problem of computing the rearrangement distance between them, i.e., finding the minimum number of DCJ operations that transform one genome into the other. We propose a linear time approximation algorithm with approximation factor O(k) for the DCJ distance problem, where k is the maximum number of duplicates of any gene in the input genomes. Our algorithm uses as an intermediate step an O(k)-approximation for the minimum common string partition problem, which is closely related to the DCJ distance problem. Experiments on simulated data sets show that the algorithm is very competitive both in efficiency and quality of the solutions.
KeywordsInteger Linear Program Adjacency Graph Breakpoint Distance Input Genome Integer Linear Program Solver
- 7.Farach, M.: Optimal suffix tree construction with large alphabets. In: Proceedings of IEEE/FOCS 1997, pp. 137–143 (1997)Google Scholar
- 9.Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of FOCS 1995, pp. 581–592 (1995)Google Scholar
- 14.Swenson, K., Marron, M., Earnest-DeYong, K., Moret, B.M.E.: Approximating the true evolutionary distance between two genomes. In: Proceedings of ALENEX/ANALCO 2005, pp. 121–129 (2005)Google Scholar