Research on the One-sided Genome Scaffold Filling Problem with Restricted Insertion Positions
The development of gene sequencing technology has continuously improved the speed of obtaining genome sequences,but current-ly widely used sequencing technologies often produce genome frameworks with partial gene deletions.The use of genome fragment filling tech-nology can effectively improve the integrity of genome frameworks and reduce sequencing costs.In previous studies,missing genes could be in-serted between any two genes in an incomplete sequence;In the later stage,there are limitations on the selection of insertion positions for missing genes in genome frameworks provided in the form of contigs and block matching.This type of fragment filling problem is more general.To this end,research was conducted on the problem of single-sided genome frame filling with restricted insertion positions,and the research progress of this problem was analyzed.The core ideas,processes,advantages and disadvantages of existing FPT algorithms and approximation algorithms were discussed in detail.During the research process,issues such as redundant common adjacency and low approximation perfor-mance were identified,and corresponding solutions were proposed.Future research directions and challenges were analyzed.