Speeding Hirschberg Algorithm for Sequence Alignment
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 27 Apr 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.