A new 1.375-approximation algorithm for sorting by transpositions.
Luiz Augusto G. SilvaLuis Antonio B. KowadaNoraí Romeu RoccoMaria Emília M. T. WalterPublished in: Algorithms Mol. Biol. (2022)
Keyphrases
- experimental evaluation
- closed form
- preprocessing
- optimization algorithm
- high accuracy
- theoretical analysis
- learning algorithm
- improved algorithm
- classification algorithm
- detection algorithm
- input data
- computational cost
- computational complexity
- cost function
- optimal solution
- objective function
- simulated annealing
- k means
- convergence rate
- matching algorithm
- times faster
- clustering method
- sorting algorithms
- polynomial time approximation
- polygonal approximation
- data sets
- error bounds
- search space
- segmentation algorithm
- computationally efficient
- significant improvement
- multi objective
- worst case