A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals.
Krister M. SwensonPublished in: CoRR (2024)
Keyphrases
- probabilistic model
- single pass
- computationally efficient
- preprocessing
- optimal solution
- worst case
- dynamic programming
- cost function
- times faster
- search space
- significant improvement
- classification algorithm
- computational cost
- computational complexity
- detection algorithm
- optimization algorithm
- matching algorithm
- selection algorithm
- highly efficient
- theoretical analysis
- learning algorithm
- simulated annealing
- experimental evaluation
- k means
- expectation maximization
- linear programming
- segmentation algorithm
- high accuracy
- np hard
- artificial neural networks
- improved algorithm
- objective function
- data sets
- pruning strategy
- memory efficient
- straight forward
- provably correct