Abstract
Sorting a permutation by transpositions (SPbT) is an important problem in bioinformtics. In this article, we improve the running time of the best known approximation algorithm for SPbT.
- Title
- The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time
- Creators - without role
- Jesun Sahariar Firoz - Bangladesh University of Engineering and TechnologyMasud Hasan - Bangladesh University of Engineering and TechnologyAshik Zinnat Khan - Bangladesh University of Engineering and TechnologyM Sohel Rahman
- Publication Details
- Journal of computational biology, Vol.18(8), pp.1007-1011
- Identifiers
- 9929688408331
- Academic Unit
- Taibah University
- Language
- English
- Resource Type
- Journal article