Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Foulser, D., Li, M., Yang, Q.: Theory and algorithms for plan merging. Artificial Intelligence 57, 143–181 (1992)
2. Timkovsky, V.: Complexity of common subsequence and supersequence problems and related problems. Cybernetics 25, 565–580 (1990)
3. Hallet, M.: An integrated complexity analysis of problems from computational biology. PhD thesis, University of Victoria (1996)
4. Bodlaender, H., Downey, R., Fellows, M., Wareham, H.: The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science 147, 31–54 (1994)
5. Middendorf, M.: More on the complexity of common superstring and supersequence problems. Theoretical Computer Science 125, 205–228 (1994)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献