当前位置:
X-MOL 学术
›
Inf. Process. Lett.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Longest common subsequence in sublinear space
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-12-30 , DOI: 10.1016/j.ipl.2020.106084 Masashi Kiyomi , Takashi Horiyama , Yota Otachi
中文翻译:
亚线性空间中最长的公共子序列
更新日期:2021-01-12
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-12-30 , DOI: 10.1016/j.ipl.2020.106084 Masashi Kiyomi , Takashi Horiyama , Yota Otachi
We present the first -space polynomial-time algorithm for computing the length of a longest common subsequence. Given two strings of length n, the algorithm runs in time with bits of space.
中文翻译:
亚线性空间中最长的公共子序列
我们提出第一个 -空间多项式时间算法,用于计算最长公共子序列的长度。给定两个长度为n的字符串,该算法在 与时间 一点空间。