The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time
Jesun Sahariar FirozMasud HasanAshik Zinnat KhanM. Sohel RahmanPublished in: CoRR (2009)
Keyphrases
- dynamic programming
- worst case
- experimental evaluation
- computational cost
- high accuracy
- objective function
- optimal solution
- computational complexity
- preprocessing
- improved algorithm
- clustering method
- ant colony optimization
- expectation maximization
- significant improvement
- similarity measure
- randomized algorithm
- greedy algorithm
- times faster
- polynomial time approximation
- probabilistic model
- detection algorithm
- computationally efficient
- data sets
- cost function
- feature selection
- learning algorithm