Author:
Huang J.,Roy S.,Asaithambi A.
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Bafna V, Pavel PA (1998) Sorting by transpositions. SIAM J Discrete Math
2. Bafna V, Pevzner PA (1996) Genome rearrangements and sorting by reversals. SIAM J Comput 25(2):272–289. doi: 10.1137/S0097539793250627
3. Bein WW, Larmore LL, Latifi S, Sudborough IH (2003) Block sorting is hard. Int J Found Comput Sci 14(03):425–437
4. Bein WW, Larmore LL, Morales L, Sudborough IH (2009) A quadratic time 2-approximation algorithm for block sorting. Theor Comput Sci 410(8):711–717
5. Bulteau L, Fertin G, Rusu I (2001) Sorting by transpositions is difficult. In: Proceedings of the 38th international colloquim conference on automata, languages and programming—volume part I, ICALP’11. Springer, Berlin, pp 654–665. http://dl.acm.org/citation.cfm?id=2027127.2027197
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Implementing algorithms for sorting by strip swaps;Proceedings of the 13th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics;2022-08-07
2. Erratum to: New approximations for block sorting;Network Modeling Analysis in Health Informatics and Bioinformatics;2017-01-21