论文标题
超速超速Hirschberg算法以进行序列比对
Speeding Hirschberg Algorithm for Sequence Alignment
论文作者
论文摘要
Hirschberg算法的使用降低了恢复线性空间最长的常见子范围的空间成本。相同的技术可以应用于类似的问题，例如序列比对。但是，付款的价格是时间成本的重复。我们在这里提出了一种将这段时间开销至可忽略的技术。
The use of Hirschberg algorithm reduces the spatial cost of recovering the Longest Common Subsequence to linear space. The same technique can be applied to similar problems like Sequence Alignment. However, the price to pay is a duplication of temporal cost. We present here a technique to reduce this time overhead to a negligible amount.
