An approximation algorithm for genome sorting by reversals to recover all adjacencies.
Shanshan ZhaiPeng ZhangDaming ZhuWeitian TongYao XuGuohui LinPublished in: J. Comb. Optim. (2019)
Keyphrases
- times faster
- detection algorithm
- linear programming
- expectation maximization
- dynamic programming
- search space
- worst case
- high accuracy
- preprocessing
- monte carlo
- objective function
- improved algorithm
- learning algorithm
- genetic algorithm
- segmentation algorithm
- computationally efficient
- polygonal approximation
- neural network
- cost function
- k means
- optimal solution
- tree structure
- randomized algorithm
- decision trees
- error bounds
- closed form
- matching algorithm
- computational complexity
- probabilistic model
- ant colony optimization
- significant improvement
- experimental evaluation
- computational cost
- markov random field