A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions.
Andre Rodrigues OliveiraGéraldine JeanGuillaume FertinKlairton Lima BritoUlisses DiasZanoni DiasPublished in: AlCoB (2020)
Keyphrases
- times faster
- approximation ratio
- np hard
- simulated annealing
- error bounds
- detection algorithm
- learning algorithm
- experimental evaluation
- dynamic programming
- objective function
- significant improvement
- selection algorithm
- high accuracy
- theoretical analysis
- tree structure
- approximation algorithms
- path planning
- cost function
- preprocessing
- computationally efficient
- special case
- matching algorithm
- computational complexity
- optimal solution
- convergence rate
- lower bound
- worst case
- improved algorithm