Abstract
We address the problem of finding the minimal number of block interchanges required to transform a duplicated unilinear genome into a single tandem duplicated unilinear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem. This is the extended version of [1].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Thomas, A., Ouangraoua, A., Varré, J.S.: Genome halving by block interchange. In: BIOINFORMATICS 2012, Third International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Portugal, February 1-4 (2012)
Christie, D.A.: Sorting permutations by block-interchanges. Inf. Process. Lett. 60, 165–169 (1996)
Lin, Y.C., Lu, C.L., Chang, H.Y., Tang, C.Y.: An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species. Journal of Computational Biology 12, 102–112 (2005)
Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340–3346 (2005)
El-Mabrouk, N., Nadeau, J.H., Sankoff, D.: Genome Halving. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 235–250. Springer, Heidelberg (1998)
El-Mabrouk, N., Sankoff, D.: The reconstruction of doubled genomes. SIAM J. Comput. 32, 754–792 (2003)
Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal Genome Median and Halving Problems. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 1–13. Springer, Heidelberg (2008)
Warren, R., Sankoff, D.: Genome halving with double cut and join. In: Brazma, A., Miyano, S., Akutsu, T. (eds.) Proceedings of APBC 2008. Advances in Bioinformatics and Computational Biology, vol. 6, pp. 231–240. Imperial College Press (2008)
Mixtacki, J.: Genome Halving under DCJ Revisited. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 276–286. Springer, Heidelberg (2008)
Kováč, J., Braga, M.D.V., Stoye, J.: The Problem of Chromosome Reincorporation in DCJ Sorting and Halving. In: Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol. 6398, pp. 13–24. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thomas, A., Ouangraoua, A., Varré, JS. (2013). Single Tandem Halving by Block Interchange. In: Gabriel, J., et al. Biomedical Engineering Systems and Technologies. BIOSTEC 2012. Communications in Computer and Information Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38256-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-38256-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38255-0
Online ISBN: 978-3-642-38256-7
eBook Packages: Computer ScienceComputer Science (R0)