Abstract
We study the problem of sorting by transpositions, which is related to comparative genomics. Our goal is to determine how good approximation algorithms which do not rely on the cycle graph are when it comes to approximation ratios by implementing three such algorithms. We compare their theoretical approximation ratio to the experimental results obtained by running them for all permutations of up to 13 elements. Our results suggest that the approaches adopted by these algorithms are not promising alternatives in the design of approximation algorithms with low approximation ratios. Furthermore, we prove an approximation bound of 3 for a constrained version of one algorithm, and close a missing gap on the proof for the approximation ratio of another algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics 11(2), 224–240 (1998)
Benoît-Gagné, M., Hamel, S.: A New and Faster Method of Sorting by Transpositions. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 131–141. Springer, Heidelberg (2007)
Bulteau, L., Fertin, G., Rusu, I.: Sorting by Transpositions Is Difficult. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 654–665. Springer, Heidelberg (2011)
Dias, U., Dias, Z.: Extending Bafna-Pevzner algorithm. In: Proceedings of the International Symposium on Biocomputing (ISB 2010), pp. 1–8. ACM, New York (2010)
Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 3(4), 369–379 (2006)
Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. The MIT Press (2009)
Galvão, G.R., Dias, Z.: GRAAu: Genome Rearrangement Algorithm Auditor. In: Proceedings of the 4th International Conference on Bioinformatics and Computational Biology (BICoB 2012), Las Vegas, NV, USA, pp. 97–101 (2012)
Galvão, G.R., Dias, Z.: On the performance of sorting permutations by prefix operations. In: Proceedings of the 4th International Conference on Bioinformatics and Computational Biology (BICoB 2012), Las Vegas, NV, USA, pp. 102–107 (2012)
Guyer, S.A., Heath, L.S., Vergara, J.P.: Subsequence and run heuristics for sorting by transpositions. Technical Report TR-97-20, Computer Science, Virginia Polytechnic Institute and State University (1997)
Walter, M.E.M.T., Dias, Z., Meidanis, J.: A new approach for approximating the transposition distance. In: Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE 2000), pp. 199–208. IEEE Computer Society, Washington, DC (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galvão, G.R., Dias, Z. (2012). On the Approximation Ratio of Algorithms for Sorting by Transpositions without Using Cycle Graphs. In: de Souto, M.C., Kann, M.G. (eds) Advances in Bioinformatics and Computational Biology. BSB 2012. Lecture Notes in Computer Science(), vol 7409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31927-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-31927-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31926-6
Online ISBN: 978-3-642-31927-3
eBook Packages: Computer ScienceComputer Science (R0)