Length and Symmetry on the Sorting by Weighted Inversions Problem
Large-scale mutational events that occur when stretches of DNA sequence move throughout genomes are called genome rearrangement events. In bacteria, inversions are one of the most frequently observed rearrangements. In some bacterial families, inversions are biased in favor of symmetry as shown by recent research [6, 8, 10]. In addition, several results suggest that short segment inversions are more frequent in the evolution of microbial genomes [4,6,15]. Despite the fact that symmetry and length of the reversed segments seem very important, they have not been considered together in any problem in the genome rearrangement field. Here, we define the problem of sorting genomes (or permutations) using inversions whose costs are assigned based on their lengths and asymmetries. We present five procedures and we assess these procedure performances on small sized permutations. The ideas presented in this paper provide insights to solve the problem and set the stage for a proper theoretical analysis.
KeywordsGenome Rearrangement Greedy Heuristic Identity Permutation Greedy Function Reversed Segment
Unable to display preview. Download preview PDF.
- 1.Arruda, T.S., Dias, U., Dias, Z.: Heuristics for the sorting by length-weighted inversion problem. In: Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, pp. 498–507 (2013)Google Scholar
- 4.Blanchette, M., Kunisawa, T., Sankoff, D.: Parametric genome rearrangement. Gene 172(1), C11–C17 (1996)Google Scholar
- 6.Darling, A.E., Miklós, I., Ragan, M.A.: Dynamics of genome rearrangement in bacterial populations. PLoS Genetics 4(7), e1000128 (2008)Google Scholar
- 7.Dias, U., Baudet, C., Dias, Z.: Greedy randomized search procedure to sort genomes using symmetric, almost-symmetric and unitary inversions. In: Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, BCB 2013, pp. 181–190. ACM, New York (2013)Google Scholar
- 9.Dias, Z., Dias, U., Setubal, J.C., Heath, L.S.: Sorting genomes using almost-symmetric inversions. In: Proceedings of the 27th Symposium On Applied Computing (SAC 2012), Riva del Garda, Italy, pp. 1–7 (2012)Google Scholar
- 10.Eisen, J.A., Heidelberg, J.F., White, O., Salzberg, S.L.: Evidence for symmetric chromosomal inversions around the replication origin in bacteria. Genome Biology 1(6), research0011.1–research0011.9 (2000)Google Scholar
- 12.Lefebvre, J.F., El-Mabrouk, N., Tillier, E., Sankoff, D.: Detection and validation of single gene inversions. Bioinformatics 19(suppl 1), i190–196 (2003) Google Scholar
- 14.Pinter, R.Y., Skiena, S.: Genomic sorting with length-weighted reversals. Genome Informatics 13, 2002 (2002)Google Scholar