.png){kind=icon}
返回
Exemplar longest common subsequence
.png){kind=icon}
OA
AI
DOI：10.1109/TCBB.2007.1066.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence (ELCS) of a set of sequences (ELCS problem), a generalization of the Longest Common Subsequence problem, where the input sequences are over the union of two disjoint sets of symbols, a set of mandatory symbols and a set of optional symbols. We show that different versions of the problem are APX-hard even for instances with two sequences. Moreover, we show that the related problem of determining the existence of a feasible solution of the ELCS of two sequences is NP-hard. On the positive side, we first present an efficient algorithm for the ELCS problem over instances of two sequences where each mandatory symbol can appear in total at most three times in the sequences. Furthermore, we present two fixed-parameter algorithms for the ELCS problem over instances of two sequences where the parameter is the number of mandatory symbols.
Keyword:
longest common subsequence
comparative genomics
algorithm design and analysis
combinatorial algorithms
analysis of algorithms
problem complexity
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏UBVRI photometry of stars useful for checking equipment orientation stabilityUBVRI恒星光度法可用于检查设备的方向稳定性
PREAI
分享收藏 没有更多内容
没有更多内容