Rearrangement of DNA fragments: a branch-and-cut algorithm.
Carlos Eduardo FerreiraC. Carvalho de SouzaYoshiko WakabayashiPublished in: Discret. Appl. Math. (2002)
Keyphrases
- dynamic programming
- improved algorithm
- preprocessing
- optimization algorithm
- np hard
- computational complexity
- experimental evaluation
- expectation maximization
- selection algorithm
- detection algorithm
- simulated annealing
- worst case
- computational cost
- cost function
- computationally efficient
- segmentation algorithm
- clustering method
- objective function
- similarity measure
- graph cuts
- theoretical analysis
- significant improvement
- path planning
- times faster
- convex hull
- convergence rate
- search space