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 | |
Publication status | Published - 2019 Nov 12 |
Keywords
- Algorithms
- Longest common subsequence
- String comparison
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)