Back to Search
Start Over
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O( n log n) Time.
- Source :
-
Journal of Computational Biology . Aug2011, Vol. 18 Issue 8, p1007-1011. 5p. - Publication Year :
- 2011
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10665277
- Volume :
- 18
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- Journal of Computational Biology
- Publication Type :
- Academic Journal
- Accession number :
- 91277267
- Full Text :
- https://doi.org/10.1089/cmb.2010.0042