Hirschberg's Algorithm for Approximate Matching
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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH University of Science and Technology Press
2002-01-01
|
| Series: | Computer Science |
| Subjects: | |
| Online Access: | http://www.csci.agh.edu.pl/42/1/cs2002%2D06.pdf |