Algorithms for the Longest Common Subsequence Problem

Koji Hakata (
Hiroshi Imai

Department of Information Science, University of Tokyo


The algorithms for computing an LCS between two strings were given by many papers, but there is no efficient algorithm for computing an LCS between more than two strings. This paper proposes a method for computing efficiently the LCS between three or more strings.