加速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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。