论文标题
增量多个最长的常见子序列
Incremental Multiple Longest Common Sub-Sequences
论文作者
论文摘要
我们考虑更新有关多个最长常见子序列的信息的问题。这种子序列用于突出几个信息序列共享的信息，因此它被广泛用于生物信息学和计算基因组学。在本文中，我们提出了一种维护此信息的方法，当基础序列进行修改时，即添加字母并从序列的极端删除时。在实验上，我们的数据结构对技术的状态获得了显着改善。
We consider the problem of updating the information about multiple longest common sub-sequences. This kind of sub-sequences is used to highlight information that is shared across several information sequences, therefore it is extensively used namely in bioinformatics and computational genomics. In this paper we propose a way to maintain this information when the underlying sequences are subject to modifications, namely when letters are added and removed from the extremes of the sequence. Experimentally our data structure obtains significant improvements over the state of the art.
