TY - JOUR
T1 - Maximal common subsequence algorithms
AU - Sakai, Yoshifumi
N1 - Publisher Copyright:
© 2019 Elsevier B.V.
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2019/11/12
Y1 - 2019/11/12
N2 - A common subsequence of two strings is maximal if inserting any character into it no longer yields a common subsequence. The present article proposes a (sub)linearithmic-time, linear-space algorithm for finding a maximal common subsequence of two strings and a linear-time algorithm for determining if a common subsequence of two strings is maximal.
AB - A common subsequence of two strings is maximal if inserting any character into it no longer yields a common subsequence. The present article proposes a (sub)linearithmic-time, linear-space algorithm for finding a maximal common subsequence of two strings and a linear-time algorithm for determining if a common subsequence of two strings is maximal.
KW - Algorithms
KW - Longest common subsequence
KW - String comparison
UR - http://www.scopus.com/inward/record.url?scp=85068266259&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85068266259&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2019.06.020
DO - 10.1016/j.tcs.2019.06.020
M3 - Article
AN - SCOPUS:85068266259
VL - 793
SP - 132
EP - 139
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
ER -