%0 Journal Article
%T Hirschberg's Algorithm for Approximate Matching
%A Adam Drozdek
%J Computer Science
%D 2002
%I AGH University of Science and Technology Press
%X The Hirschberg algorithm was devised to solve the longest common subsequence problem. The paper discusses the way of adopting the algorithm to solve the string matching problem in linear space to determine edit distance for two strings and their alignment.
%K Pattern recognition and processing
%U http://www.csci.agh.edu.pl/42/1/cs2002%2D06.pdf