GENOME HALVING BY BLOCK INTERCHANGE

Antoine Thomas, Aïda Ouangraoua, Jean-Stéphane Varré, Aïda Ouangraoua, Jean-Stéphane Varré

Abstract

We address the problem of finding the minimal number of block interchanges required to transform a duplicated linear genome into a tandem duplicated linear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem.

References

  1. Christie, D. A. (1996). Sorting permutations by blockinterchanges. Inf. Process. Lett., 60(4):165-169.
  2. El-Mabrouk, N., Nadeau, J. H., and Sankoff, D. (1998). Genome halving. In Farach-Colton, M., editor, Proceedings of CPM'98, volume 1448 of Lecture Notes in Computer Science, pages 235-250. Springer.
  3. El-Mabrouk, N. and Sankoff, D. (2003). The reconstruction of doubled genomes. SIAM J. Comput., 32(3):754- 792.
  4. Kovác, J., Braga, M. D. V., and Stoye, J. (2010). The problem of chromosome reincorporation in DCJ sorting and halving. In Tannier, E., editor, RECOMB-CG, volume 6398 of Lecture Notes in Computer Science, pages 13-24. Springer.
  5. Lin, Y. C., Lu, C. L., Chang, H.-Y., and Tang, C. Y. (2005). An efficient algorithm for sorting by blockinterchanges and its application to the evolution of vibrio species. Journal of Computational Biology, 12(1):102-112.
  6. Mixtacki, J. (2008). Genome halving under DCJ revisited. In Hu, X. and Wang, J., editors, Proceedings of COCOON'08, volume 5092 of Lecture Notes in Computer Science, pages 276-286. Springer.
  7. Tannier, E., Zheng, C., and Sankoff, D. (2008). Multichromosomal genome median and halving problems. In Crandall, K. A. and Lagergren, J., editors, Proceedings of WABI'08, volume 5251 of Lecture Notes in Computer Science, pages 1-13. Springer.
  8. Warren, R. and Sankoff, D. (2008). Genome halving with double cut and join. In Brazma, A., Miyano, S., and Akutsu, T., editors, Proceedings of APBC'08, volume 6 of Advances in Bioinformatics and Computational Biology, pages 231-240. Imperial College Press.
  9. Yancopoulos, S., Attie, O., and Friedberg, R. (2005). Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21(16):3340-3346.
Download


Paper Citation


in Harvard Style

Thomas A., Ouangraoua A., Varré J., Varré J. and Ouangraoua A. (2012). GENOME HALVING BY BLOCK INTERCHANGE . In Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2012) ISBN 978-989-8425-90-4, pages 58-65. DOI: 10.5220/0003757200580065


in Bibtex Style

@conference{bioinformatics12,
author={Antoine Thomas and Aïda Ouangraoua and Jean-Stéphane Varré and Jean-Stéphane Varré and Aïda Ouangraoua},
title={GENOME HALVING BY BLOCK INTERCHANGE},
booktitle={Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2012)},
year={2012},
pages={58-65},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003757200580065},
isbn={978-989-8425-90-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2012)
TI - GENOME HALVING BY BLOCK INTERCHANGE
SN - 978-989-8425-90-4
AU - Thomas A.
AU - Ouangraoua A.
AU - Varré J.
AU - Varré J.
AU - Ouangraoua A.
PY - 2012
SP - 58
EP - 65
DO - 10.5220/0003757200580065