A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals.
Haim KaplanRon ShamirRobert Endre TarjanPublished in: SIAM J. Comput. (1999)
Keyphrases
- learning algorithm
- objective function
- dynamic programming
- experimental evaluation
- optimal solution
- preprocessing
- times faster
- improved algorithm
- optimization algorithm
- computational complexity
- k means
- recognition algorithm
- input data
- memory efficient
- theoretical analysis
- expectation maximization
- high accuracy
- computational cost
- np hard
- bayesian networks
- simulated annealing
- least squares
- probability distribution
- detection algorithm
- experimental study
- tree structure
- classification algorithm
- path planning
- significant improvement
- single pass
- data sets