Sorting by Cuts, Joins and Whole Chromosome Duplications
Genome rearrangement problems have been extensively studied due to their importance in biology. Most studied models assumed a single copy per gene. However, in reality duplicated genes are common, most notably in cancer. Here we make a step towards handling duplicated genes by considering a model that allows the atomic operations of cut, join and whole chromosome duplication. Given two linear genomes, \(\varGamma \) with one copy per gene, and \(\varDelta \) with two copies per gene, we give a linear time algorithm for computing a shortest sequence of operations transforming \(\varGamma \) into \(\varDelta \) such that all intermediate genomes are linear. We also show that computing an optimal sequence with fewest duplications is NP-hard.
KeywordsSCJ Genome rearrangements Computational genomics
- 8.Caprara, A.: Sorting by reversals is difficult. In: Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB), pp. 75–83, New York, USA (1997)Google Scholar
- 11.Dias, Z., Meidanis, J.: Genome rearrangements distance by fusion, fission, and transposition is easy. In: International Symposium on String Processing and Information Retrieval, pp. 250. IEEE Computer Society (2001)Google Scholar
- 15.Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing (STOC), vol. 46, pp. 178–189, New York, USA (1995)Google Scholar
- 18.Mira, C.V.G., Meidanis, J.: Sorting by block-interchanges and signed reversals. ITNG 7, 670–676 (2007)Google Scholar