The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time

Details The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time

2009-10-17

arxiv.org/abs/0910.3292v1

Computer Science

Data Structures and Algorithms

5 pages

Scientific paper

Sorting a Permutation by Transpositions (SPbT) is an important problem in Bioinformtics. In this paper, we improve the running time of the best known approximation algorithm for SPbT. We use the permutation tree data structure of Feng and Zhu and improve the running time of the 1.375 Approximation Algorithm for SPbT of Elias and Hartman to $O(n\log n)$. The previous running time of EH algorithm was $O(n^2)$.

Affiliated with

Also associated with

No associations

Rating

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89607