Year: 2022
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Authors: Llorens, David, Vilar, Juan Miguel
Institution: Universitat Jaume I
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4225095220