arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.07458cs.DS
收藏

序列中的链接片段:是否扫描

Chaining fragments in sequences: to sweep or not

Julien Allali, Laetitia Bourgeade, Cedric Chauve

摘要:

计算最优片段链是字符串算法中的经典问题,在计算生物学中有重要应用。基于不同的原理,存在两种有效的动态规划算法来解决该问题。在本说明中,我们展示了如何结合这些算法的两个原则,以设计一个混合动态规划算法,结合了这两种算法的优点。

英文摘要:

Computing an optimal chain of fragments is a classical problem in string algorithms, with important applications in computational biology. There exist two efficient dynamic programming algorithms solving this problem, based on different principles. In the present note, we show how it is possible to combine the principles of two of these algorithms in order to design a hybrid dynamic programming algorithm that combines the advantages of both algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑