Maximal common subsequence algorithms

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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 languageEnglish
Pages (from-to)132-139
Number of pages8
JournalTheoretical Computer Science
Publication statusPublished - 2019 Nov 12


  • Algorithms
  • Longest common subsequence
  • String comparison


Dive into the research topics of 'Maximal common subsequence algorithms'. Together they form a unique fingerprint.

Cite this