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.
@article{arxiv.2204.12801,
title = {Speeding Hirschberg Algorithm for Sequence Alignment},
author = {David Llorens and Juan Miguel Vilar},
journal= {arXiv preprint arXiv:2204.12801},
year = {2022}
}