A New Approximation Algorithm for the Contig-Based One-Sided Repetitive Genomic Scaffold Filling Problem

Since most of the current biological research is based on the assumption that genomic scaffold can provide complete information, it is of great significance to study the genomic scaffold filling problem. The research goal of the one-sided genomic scaffold filling algorithm is to fill the missing gene into the incomplete gene scaffold to obtain the rearranged gene scaffold, so as to maximize the similarity between it and the complete genomic scaffold. This paper mainly studies the one-sided repeat genomic scaffold filling problem with repetitive genes based on maximum adjacencies. Using the idea of constructing bipartite graphs and maximum matching, a new filling algorithm based on maximizing adjacency is proposed, which lays the foundation for further research on the one-sided scaffold filling problem based on contig in the future.