This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
New Bounds and Tractable Instances for the Transposition Distance
October-December 2006 (vol. 3 no. 4)
pp. 380-394
The problem of sorting by transpositions asks for a sequence of adjacent interval exchanges that sorts a permutation and is of the shortest possible length. The distance of the permutation is defined as the length of such a sequence. Despite the apparently intuitive nature of this problem, introduced in 1995 by Bafna and Pevzner, the complexity of both finding an optimal sequence and computing the distance remains open today. In this paper, we establish connections between two different graph representations of permutations, which allows us to compute the distance of a few nontrivial classes of permutations in linear time and space, bypassing the use of any graph structure. By showing that every permutation can be obtained from one of these classes, we prove a new tight upper bound on the transposition distance. Finally, we give improved bounds on some other families of permutations and prove formulas for computing the exact distance of other classes of permutations, again in polynomial time.

[1] J. Meidanis and J. Setubal, Introduction to Computational Molecular Biology. Brooks-Cole, 1997.
[2] P.A. Pevzner, Computational Molecular Biology. MIT Press, 2000.
[3] V. Bafna and P.A. Pevzner, “Sorting Permutations by Transpositions,” Proc. Sixth Ann. ACM-SIAM Symp. Discrete Algorithms, pp.614-623, Jan. 1995.
[4] V. Bafna and P.A. Pevzner, “Sorting by Transpositions,” SIAM J. Discrete Math., vol. 11, no. 2, pp. 224-240, May 1998.
[5] D.A. Christie, “Genome Rearrangement Problems,” PhD dissertation, Univ. of Glasgow, Scotland, Aug. 1998.
[6] T. Hartman and R. Shamir, “A Simpler and Faster 1.5-Approximation Algorithm for Sorting by Transpositions,” Information and Computation, vol. 204, no. 2, pp. 275-290, Feb. 2006.
[7] I. Elias and T. Hartman, “A 1.375-Approximation Algorithm for Sorting by Transpositions,” Proc. Fifth Workshop Algorithms in Bioinformatics, R. Casadio and G. Myers, eds., pp. 204-214, Oct. 2005.
[8] S.A. Guyer, L.S. Heath, and J.P. Vergara, “Subsequence and Run Heuristics for Sorting by Transpositions,” Fourth DIMACS Algorithm Implementation Challenge, Rutgers Univ., Aug. 1995.
[9] J.P.C. Vergara, “Sorting by Bounded Permutations,” PhD dissertation, Virginia Polytechnic Inst., Blacksburg, Apr. 1997.
[10] M.E.M.T. Walter, L.R.A.F. Curado, and A.G. Oliveira, “Working on the Problem of Sorting by Transpositions on Genome Rearrangements,” Proc. 14th Ann. Symp. Combinatorial Pattern Matching, pp. 372-383, 2003.
[11] Z. Dias and J. Meidanis, “An Alternative Algebraic Formalism for Genome Rearrangements,” Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families, vol. 1, pp. 213-223, 2000.
[12] Z. Dias and J. Meidanis, “Genome Rearrangements Distance by Fusion, Fission, and Transposition Is Easy,” Proc. Eighth Int'l Symp. String Processing and Information Retrieval, pp. 250-253, Nov. 2001.
[13] A. Labarre, “A New Tight Upper Bound on the Transposition Distance,” Proc. Fifth Workshop Algorithms in Bioinformatics, R.Casadio and G. Myers, eds., pp. 216-227, Oct. 2005.
[14] H. Eriksson, K. Eriksson, J. Karlander, L. Svensson, and J. Wästlund, “Sorting a Bridge Hand,” Discrete Math., vol. 241, nos.1-3, pp. 289-300, 2001.
[15] A. Hultman, “Toric Permutations,” master's thesis, Dept. of Math., KTH, Stockholm, Sweden, 1999.
[16] Z. Dias, J. Meidanis, and M.E.M.T. Walter, “A New Approach for Approximating the Transposition Distance,” Proc. Seventh Int'l Symp. String Processing and Information Retrieval, pp. 199-208, Sept. 2000.
[17] S. Hannenhalli and P.A. Pevzner, “Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals,” J. ACM, vol. 46, no. 1, pp. 1-27, Jan. 1999.
[18] V. Bafna and P.A. Pevzner, “Genome Rearrangements and Sorting by Reversals,” Proc. 34th Annual Symp. Foundations of Computer Science, pp. 148-157, 1993.

Index Terms:
Genome rearrangements, permutations, sorting by transpositions.
Citation:
Anthony Labarre, "New Bounds and Tractable Instances for the Transposition Distance," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 4, pp. 380-394, Oct.-Dec. 2006, doi:10.1109/TCBB.2006.56
Usage of this product signifies your acceptance of the Terms of Use.