A more efficient algorithm for perfect sorting by reversals.
Sèverine BérardCédric ChauveChristophe PaulPublished in: Inf. Process. Lett. (2008)
Keyphrases
- dynamic programming
- learning algorithm
- single pass
- computational complexity
- preprocessing
- high efficiency
- high accuracy
- linear programming
- computationally efficient
- optimization algorithm
- optimal solution
- times faster
- particle swarm optimization
- experimental study
- memory efficient
- hardware implementation
- sorting algorithms
- matching algorithm
- theoretical analysis
- significant improvement
- np hard
- probabilistic model
- computational cost
- convex hull
- convergence rate
- recognition algorithm
- improved algorithm
- classification algorithm
- detection algorithm
- estimation algorithm
- space complexity
- computationally intensive
- search space
- pruning strategy
- bayesian networks
- space partitioning
- genetic algorithm