A New Approximation Algorithm for the Contig-Based One-Sided Repetitive Genomic Scaffold Filling Problem.
Nan LiuYongqi ZhuShenghua LiPublished in: CSAE (2022)
Keyphrases
- learning algorithm
- closed form
- computational cost
- experimental evaluation
- k means
- improved algorithm
- dynamic programming
- detection algorithm
- preprocessing
- worst case
- monte carlo
- cost function
- objective function
- computationally efficient
- theoretical analysis
- polygonal approximation
- convergence rate
- similarity measure
- matching algorithm
- optimization algorithm
- np hard
- significant improvement
- particle swarm optimization
- high throughput
- convex hull
- linear programming
- recognition algorithm
- randomized algorithm