确定基因序列中转座子的算法
Algorithms for determining transposons in gene sequences
摘要:
一些基因可以改变它们在基因组中的相对位置。因此,对于同一物种的不同个体,基因的顺序可能是不同的。这种跳跃基因被称为转座子。一个实际问题是确定给定基因序列中的转座子。通过一个直观的规则,我们将确定转座子的生物学问题转化为确定最长共同子序列的严格数学问题。取决于基因序列是否是线性的(每个序列都有一个固定的头和尾)或循环(我们可以选择任意一个基因作为头部,前面的一个是尾部),以及基因是否有多个拷贝,我们将确定转座子的问题分为四种情况:(1)没有重复基因的线性序列;(2)没有重复基因的环状序列;(3)线性重复序列,(4)环状重复序列。在图论的帮助下,我们针对不同的场景设计了快速算法。我们还得到了一些结果,可能是组合数学的理论兴趣。
英文摘要:
Some genes can change their relative locations in a genome. Thus for different individuals of the same species, the orders of genes might be different. Such jumping genes are called transposons. A practical problem is to determine transposons in given gene sequences. Through an intuitive rule, we transform the biological problem of determining transposons into a rigorous mathematical problem of determining the longest common subsequence. Depending on whether the gene sequence is linear (each sequence has a fixed head and tail) or circular (we can choose any gene as the head, and the previous one is the tail), and whether genes have multiple copies, we classify the problem of determining transposons into four scenarios: (1) linear sequences without duplicated genes; (2) circular sequences without duplicated genes; (3) linear sequences with duplicated genes; (4) circular sequences with duplicated genes. With the help of graph theory, we design fast algorithms for different scenarios. We also derive some results that might be of theoretical interests in combinatorics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。