Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms

Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andconquer algorithm. The second algorithm is an improvement of Hunt-Szymanski algorithm based on an ef£cient computation of all dominant match points. These two algorithms use bit-vector operations and are shown to work very ef£ciently in practice.

• Type: Conference
• Year: 2001
• Where: SPIRE
• Authors: Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
• Keywords: Algorithms, Hirschberg’s Divide-andconquer Algorithm, Information Management, Longest Common Subsequence, SPIRE 2001