Maximal common subsequence algorithms

Yoshifumi Sakai

doi:10.1016/j.tcs.2019.06.020

Maximal common subsequence algorithms

Yoshifumi Sakai

AGR - Bioscience and Biotechnology for Future Bioindustries

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	132-139
Number of pages	8
Journal	Theoretical Computer Science
Volume	793
DOIs	https://doi.org/10.1016/j.tcs.2019.06.020
Publication status	Published - 2019 Nov 12

Keywords

Algorithms
Longest common subsequence
String comparison

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/j.tcs.2019.06.020

Cite this

@article{0d682668a73a4cebb9bd8a1eb6567d7c,

title = "Maximal common subsequence algorithms",

abstract = "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.",

keywords = "Algorithms, Longest common subsequence, String comparison",

author = "Yoshifumi Sakai",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier B.V.",

year = "2019",

month = nov,

day = "12",

doi = "10.1016/j.tcs.2019.06.020",

language = "English",

volume = "793",

pages = "132--139",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - Maximal common subsequence algorithms

AU - Sakai, Yoshifumi

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 -

Maximal common subsequence algorithms

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this