Longest common subsequence in sublinear space

Masashi Kiyomi,Takashi Horiyama,Yota Otachi

Information Processing Letters（2021）

引用 7|浏览38

暂无评分

摘要

•The first o(n)-space polynomial-time algorithm for the longest common subsequence problem is presented.•Levenshtein distance can be computed in the same time and space complexity.•Whether there is a truly sublinear space polynomial-time algorithm for LCS is open.

查看译文

关键词

Computational complexity,Space-efficient algorithm,Longest common subsequence,Levenshtein distance

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要