Abstract
To this date, neither a polynomial algorithm to sort a permutation by transpositions has been found, nor a proof that it is an NP-hard problem has been given. Therefore, determining the exact transposition distance d t (π) of a generic permutation π, relative to the identity, is generally done by an exhaustive search on the space S n of all permutations of n elements. In a 2001 paper, Eriksson et al. [1] made a breakthrough by proposing a structure named by them as toric graph, which allowed the reduction of the search space, speeding-up the process, such that greater instances could be solved. Surprisingly, Eriksson et al. were able to exhibit a counterexample to a conjecture by Meidanis et al. [2] that the transposition diameter would be equal to the distance of the reverse permutation \(\lfloor{n/2}\rfloor+1\). The goal of the present paper is to further study the toric graph, focusing on the case when n + 1 is prime. We observe that the transposition diameter problem for n = 16 is still open. We determine that there are exactly \(\frac{n!-n}{n+1} + n\) vertices in the toric graph and find a lower bound \(d_t(\pi) \ge \lfloor{n/2}\rfloor\) on the transposition distance for every permutation π in a unitary toric class that is not the identity permutation. We provide experimental data on the exact distance of those permutations to back our conjecture that \(d_t(\pi) \le \lfloor{n/2}\rfloor + 1\), where π belongs to a unitary toric class, and that \(\lfloor{n/2}\rfloor + 1\) is equal to the transposition diameter when n + 1 is prime.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., Wästlund, J.: Sorting a bridge hand. Discrete Math. 241(1), 289–300 (2001)
Meidanis, J., Walter, M.E.M.T., Dias, Z.: Transposition distance between a permutation and its reverse. In: Baeza-Yates, R. (ed.) Proceedings of the 4th South American Workshop on String Processing, Valparaíso, Chile, pp. 70–79. Carleton University Press (1997)
Setubal, C., Meidanis, J.: Introduction to Computational Molecular Biology. PWS Publishing (January 1997)
Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11(2), 224–240 (1998)
Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM T. Comput. Bi. 3(4), 369–379 (2006)
Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2), 272–289 (1996)
Dias, Z.: Rearranjo de genomas: uma coletânea de artigos. PhD thesis, Unicamp, Campinas, São Paulo (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de A. Hausen, R., Faria, L., de Figueiredo, C.M.H., Kowada, L.A.B. (2008). On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. In: Bazzan, A.L.C., Craven, M., Martins, N.F. (eds) Advances in Bioinformatics and Computational Biology. BSB 2008. Lecture Notes in Computer Science(), vol 5167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85557-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-85557-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85556-9
Online ISBN: 978-3-540-85557-6
eBook Packages: Computer ScienceComputer Science (R0)