Author:
Bein Wolfgang W.,Larmore Lawrence L.,Morales Linda,Sudborough I. Hal
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Bafna, V., Pevzner, P.A.: Sorting by transposition. SIAM Journal on Discrete Mathematics 11, 224–240 (1998)
2. Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM Journal on Computing 25, 272–289 (1999)
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. Caprara, A.: Sorting by reversals is difficult. In: Proceedings 1st Conference on Computational Molecular Biology, pp. 75–83. ACM, New York (1997)
5. Gates, W.H., Papadimitriou, C.H.: Bounds for sorting by prefix reversal. Discrete Mathematics 27, 47–57 (1979)
Cited by
5 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. On Sorting under Special Transpositions;2014 IEEE International Conference on Bioinformatics and Bioengineering;2014-11
5. A quadratic time 2-approximation algorithm for block sorting;Theoretical Computer Science;2009-03