将公共区间搜索从置换扩展到序列
Extending Common Intervals Searching from Permutations to Sequences
摘要:
共同间隔被定义为基因组中基因簇的模型化,其表示为排列或序列。然而,即使对于任意数量的排列,也存在用于寻找排列中的公共区间的最佳算法,而对于序列,即使对于仅两个序列,也没有提出最佳算法。令人惊讶的是,当序列减少到排列,现有的算法执行远离最佳,表明它们的性能是不依赖的,因为它们应该是,对输入序列的结构复杂性。在本文中,我们提出了一个序列的结构的不同的控制阶组成的数量$q$(称为控制数),并使用最近的算法排列,以设计一个新的算法,两个序列。它的运行时间以$O(q_1q_2p+q_1n_1+q_2n_2+N)$为单位,其中$n_1, n_2$是两个序列的长度,$q_1,q_2$是它们各自的控制数,$p$是字母表长度,$N$是要输出的解的个数。当$q_1$和/或$q_2$减少时,该算法执行得更好,并且当两个序列减少为排列时(即当$q_1=q_2=1$时),它具有与用于排列的最佳算法相同的运行时间。它也是第一个算法的序列,其运行时间涉及的参数大小的解决方案。当$q_1$和$q_2$分别为$O(n_1)$和$O(n_2)$时,该算法的效率低于其他方法。
英文摘要:
Common intervals have been defined as a modelisation of gene clusters in genomes represented either as permutations or as sequences. Whereas optimal algorithms for finding common intervals in permutations exist even for an arbitrary number of permutations, in sequences no optimal algorithm has been proposed yet even for only two sequences. Surprisingly enough, when sequences are reduced to permutations, the existing algorithms perform far from the optimum, showing that their performances are not dependent, as they should be, on the structural complexity of the input sequences. In this paper, we propose to characterize the structure of a sequence by the number $q$ of different dominating orders composing it (called the domination number), and to use a recent algorithm for permutations in order to devise a new algorithm for two sequences. Its running time is in $O(q_1q_2p+q_1n_1+q_2n_2+N)$, where $n_1, n_2$ are the sizes of the two sequences, $q_1,q_2$ are their respective domination numbers, $p$ is the alphabet size and $N$ is the number of solutions to output. This algorithm performs better as $q_1$ and/or $q_2$ reduce, and when the two sequences are reduced to permutations (i.e. when $q_1=q_2=1$) it has the same running time as the best algorithms for permutations. It is also the first algorithm for sequences whose running time involves the parameter size of the solution. As a counterpart, when $q_1$ and $q_2$ are of $O(n_1)$ and $O(n_2)$ respectively, the algorithm is less efficient than other approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。