1.375-Approximation Algorithm for Sorting by Reversals.
Piotr BermanSridhar HannenhalliMarek KarpinskiPublished in: ESA (2002)
Keyphrases
- computational complexity
- experimental evaluation
- optimal solution
- np hard
- learning algorithm
- improved algorithm
- high accuracy
- theoretical analysis
- approximation ratio
- selection algorithm
- closed form
- detection algorithm
- worst case
- significant improvement
- search space
- preprocessing
- decision trees
- expectation maximization
- optimization algorithm
- tree structure
- matching algorithm
- times faster
- convergence rate
- approximation algorithms