多序列的近似LCS改进算法
COMPUTER ENGINEERING（2011）
Abstract
提出2种针对3条源序列的近似LCS算法,近似因子均为1/|∑|.其中,线性近似LCS算法的时空复杂度均为O(n),n为最长源序列的长度,适于解决大规模问题.递归近似LCS算法时空复杂度均为O(nlogn),适于要求高精度问题.同时,这2种算法都能用于解决多序列的LCS和CLCS问题.实验验证了这2种算法的有效性.
MoreTranslated text
Key words
longest common subsequence,multiple sequences,improved approximation algorithms
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined