An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes.
Chengcheng SunHaitao JiangPublished in: BIBM (2021)
Keyphrases
- linear programming
- dynamic programming
- np hard
- linear programming relaxation
- integrality gap
- significant improvement
- experimental evaluation
- computational cost
- worst case
- tree structure
- high accuracy
- approximation ratio
- human genome
- query optimization
- detection algorithm
- optimization algorithm
- segmentation algorithm
- neural network
- search space
- computational complexity
- learning algorithm