TY - JOUR

T1 - A fast On-Line algorithm for the longest common subsequence problem with constant alphabet

AU - Sakai, Yoshifumi

PY - 2012/1

Y1 - 2012/1

N2 - This article presents an algorithm that solves an on-line version of the longest common subsequence (LCS) problem for two strings over a constant alphabet in O(d+n) time and O(m+d) space, where m is the length of the shorter string, the whole of which is given to the algorithm in advance, n is the length of the longer string, which is given as a data stream, and d is the number of dominant matches between the two strings. A new upper bound, O(p(m - q)), of d is also presented, where p is the length of the LCS of the two strings, and q is the length of the LCS of the shorter string and the m-length prefix of the longer string.

AB - This article presents an algorithm that solves an on-line version of the longest common subsequence (LCS) problem for two strings over a constant alphabet in O(d+n) time and O(m+d) space, where m is the length of the shorter string, the whole of which is given to the algorithm in advance, n is the length of the longer string, which is given as a data stream, and d is the number of dominant matches between the two strings. A new upper bound, O(p(m - q)), of d is also presented, where p is the length of the LCS of the two strings, and q is the length of the LCS of the shorter string and the m-length prefix of the longer string.

KW - Algorithm

KW - Longest common subsequence

KW - On-line algorithm

KW - String comparison

UR - http://www.scopus.com/inward/record.url?scp=84855329195&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84855329195&partnerID=8YFLogxK

U2 - 10.1587/transfun.E95.A.354

DO - 10.1587/transfun.E95.A.354

M3 - Article

AN - SCOPUS:84855329195

VL - E-95-A

SP - 354

EP - 361

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 1

ER -