Author:
Narayanaswamy N. S.,Roy Swapnoneel
Publisher
Springer International Publishing
Reference12 articles.
1. Bafna, V., Pevzner, P.A.: Sorting by Transpositions. SIAM Journal of Discrete Mathematics 11(2), 224–240 (1998)
2. Bein, W.W., Larmore, L.L., Latifi, S., Sudborough, I.H.: A Quadratic TIme 2-Approximation Algorithm for Block Sorting. Theoretical Computer Science 410(8–10), 711–717 (2009)
3. Bein, W.W., Larmore, L.L., Latifi, S., Sudborough, I.H.: Block sorting is hard. International Journal of Foundations of Computer Science 14(3), 425–437 (2003)
4. Bulteau, L., Fertin, G., Rusu, I.: Sorting by Transpositions is Difficult. Automata, Languages and Programming 6755, 654–665 (2011)
5. Christie, D.A.: Genome Rearrangement Problems. PhD Thesis, University of Glasgow (1999)
Cited by
4 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. More Results on Experimental Evaluations of Some Algorithms for Block Sorting;2020 IEEE 20th International Conference on Bioinformatics and Bioengineering (BIBE);2020-10
3. Gamification in Social Networking: A Platform for People Living with Dementia and their Caregivers;2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE);2017-10
4. New approximations for block sorting;Network Modeling Analysis in Health Informatics and Bioinformatics;2016-02-09