首页|限制插入位置的单面基因组框架填充问题研究

限制插入位置的单面基因组框架填充问题研究

扫码查看
基因测序技术的发展使基因组序列的获取速度不断加快,但目前广泛使用的测序技术通常会产生部分基因缺失的基因组框架,使用基因组片段填充技术能够有效提高基因组框架的完整性,降低测序成本.在前期研究中,缺失基因可以在不完整序列的任意两个基因之间插入;在目前研究中,针对以片段重叠群(contig)、块匹配形式给出的待填充基因组框架,其对缺失基因插入位置的选择是有限制的,该类片段填充问题更具一般性.为此,针对限制插入位置的单面基因组框架填充问题进行研究,分析该问题的研究进展,详细讨论了现有FPT算法和近似算法的核心思想、流程以及优缺点等.在研究过程中发现了冗余公共邻接和近似性能低等问题,提出了相应的解决方案,并分析了未来的研究方向和挑战.
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.

genomescaffold fillingcontigblock-matchingFPT algorithmsapproximation algorithm

柳楠、李洋、卞忠勇

展开 >

山东建筑大学 计算机科学与技术学院,山东 济南 250101

基因组 框架填充 片段重叠群 块匹配 FPT算法 近似算法

2024

软件导刊
湖北省信息学会

软件导刊

影响因子:0.524
ISSN:1672-7800
年,卷(期):2024.23(10)