Author:
Blum Christian,Cotta Carlos,Fernández Antonio J.,Gallardo José E.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Hallet, M.: An integrated complexity analysis of problems from computational biology. PhD thesis, University of Victoria (1996)
2. Sim, J., Park, K.: The consensus string problem for a metric is NP-complete. Journal of Discrete Algorithms 1(1), 111–117 (2003)
3. Rahmann, S.: The shortest common supersequence problem in a microarray production setting. Bioinformatics 19(Suppl. 2), ii156–ii161 (2003)
4. Foulser, D., Li, M., Yang, Q.: Theory and algorithms for plan merging. Artificial Intelligence 57(2-3), 143–181 (1992)
5. Timkovsky, V.: Complexity of common subsequence and supersequence problems and related problems. Cybernetics 25, 565–580 (1990)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献