A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals.
Tzvika HartmanRoded SharanPublished in: WABI (2004)
Keyphrases
- np hard
- cost function
- improved algorithm
- search space
- learning algorithm
- times faster
- selection algorithm
- computational cost
- experimental evaluation
- significant improvement
- computational complexity
- optimal solution
- dynamic programming
- recognition algorithm
- expectation maximization
- theoretical analysis
- optimization algorithm
- detection algorithm
- sorting algorithms
- matching algorithm
- path planning
- neural network
- classification algorithm
- monte carlo
- particle swarm optimization
- linear programming
- simulated annealing
- worst case
- probabilistic model