Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms (2003)
by
Maxime Crochemore
,
Costas S. Iliopoulos
,
Yoan J. Pinzon
| Citations: | 5 - 0 self |
BibTeX
@MISC{Crochemore03speeding-uphirschberg,
author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinzon},
title = {Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The first algorithm is an improvement of Hirschberg’s divide-and-conquer algorithm. The second algorithm is an improvement of Hunt-Szymanski algorithm based on an efficient computation of all dominant match points. These two algorithms use bit-vector operations and are shown to work very efficiently in practice.
