A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.
Haitao JiangLusheng WangBinhai ZhuDaming ZhuPublished in: FAW (2014)
Keyphrases
- detection algorithm
- improved algorithm
- search space
- computational complexity
- np hard
- dynamic programming
- preprocessing
- experimental evaluation
- learning algorithm
- monte carlo
- segmentation algorithm
- expectation maximization
- k means
- computational cost
- times faster
- optimization algorithm
- tree structure
- clustering method
- sorting algorithms
- error tolerance
- data sets
- closed form
- matching algorithm
- image segmentation
- ant colony optimization
- worst case
- bayesian networks
- computationally efficient
- bit rate
- input data
- linear programming
- simulated annealing