Abstract
Sorting Permutations by Transpositions is a famous problem in the Computational Biology field. This problem is NP-Hard, and the best approximation algorithm, proposed by Elias and Hartman in 2006, has an approximation factor of 1.375. Since then, several researchers have proposed modifications to this algorithm to reduce the time complexity. More recently, researchers showed that the algorithm proposed by Elias and Hartman might need one more operation above the approximation ratio and presented a new 1.375-approximation algorithm using an algebraic approach that corrected this issue. This algorithm runs in \(O(n^6)\) time. In this paper, we present an efficient way to fix Elias and Hartman algorithm that runs in \(O(n^5)\). By comparing the three approximation algorithms with all permutations of size \(n \le 12\), we also show that our algorithm finds the exact distance in more instances than the previous two algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discret. Math. 11(2), 224–240 (1998)
Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discret. Math. 26(3), 1148–1180 (2012)
Christie, D.A.: Genome Rearrangement Problems. Ph.D. thesis, Department of Computing Science, University of Glasgow (1998)
Dias, U., Dias, Z.: An improved \(1.375\)-approximation algorithm for the transposition distance problem. In: Proceeding of the 1st ACM International Conference on Bioinformatics and Computational Biology (BCB’2010), pp. 334–337. ACM, New York (2010)
Dias, U., Dias, Z.: Extending bafna-pevzner algorithm. In: Proceedings of the 1st International Symposium on Biocomputing (ISB’2010), pp. 1–8. ACM, New York (2010)
Dias, U.M.: Problemas de Comparação de Genomas. Ph.D. thesis, Institute of Computing, University of Campinas (2012). In Portuguese
Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE ACM Trans. Comput. Biol. Bioinf. 3(4), 369–379 (2006)
Galvão, G.R., Dias, Z.: An audit tool for genome rearrangement algorithms. J. Exp. Algorithmics 19, 1–34 (2014)
Silva, L.A.G., Kowada, L.A.B., Rocco, N.R., Walter, M.E.M.T.: A new 1.375-approximation algorithm for sorting by transpositions. Algorithms Mol. Biol. 17(1), 1–17 (2022). https://doi.org/10.1186/s13015-022-00205-z
Walter, M.E.M.T., Dias, Z., Meidanis, J.: A new approach for approximating the transposition distance. In: Titsworth, F.M. (ed.) Proceedings of the 7th String Processing and Information Retrieval (SPIRE’2000), pp. 199–208. IEEE Computer Society, Los Alamitos (2000)
Acknowledgment
This work was supported by the National Council of Technological and Scientific Development, CNPq (grants 140272/2020-8, 202292/2020-7, and 425340/2016-3), the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001, and the São Paulo Research Foundation, FAPESP (grants 2013/08293-7, 2015/11937-9, and 2019/27331-3).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Alexandrino, A.O., Brito, K.L., Oliveira, A.R., Dias, U., Dias, Z. (2022). A 1.375-Approximation Algorithm for Sorting by Transpositions with Faster Running Time. In: Scherer, N.M., de Melo-Minardi, R.C. (eds) Advances in Bioinformatics and Computational Biology. BSB 2022. Lecture Notes in Computer Science(), vol 13523. Springer, Cham. https://doi.org/10.1007/978-3-031-21175-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-21175-1_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21174-4
Online ISBN: 978-3-031-21175-1
eBook Packages: Computer ScienceComputer Science (R0)