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.

翻译：赫希贝格算法的使用降低了恢复线性空间的最长期常见子序列的空间成本,同样的技术也可以适用于诸如序列调整等类似问题,但是,要付出的代价是时间成本的重复。 我们在此提出一种技术,将这一时间的间接费用减少到可忽略不计的数额。