An Efficient Algorithm for the Contig Ordering Problem under Algebraic Rearrangement Distance.
Chin Lung LuPublished in: J. Comput. Biol. (2015)
Keyphrases
- np hard
- learning algorithm
- dynamic programming
- cost function
- high accuracy
- matching algorithm
- computational cost
- k means
- search space
- significant improvement
- expectation maximization
- experimental evaluation
- linear programming
- segmentation algorithm
- optimization algorithm
- optimal solution
- selection algorithm
- search algorithm
- genetic algorithm
- distance measure
- high dimensional
- detection algorithm
- distance metric
- convex hull
- improved algorithm
- highly efficient