Author:
Blum Christian,Blesa Maria J.
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM 25, 322–336 (1978)
2. Computer Science and Computational Biology;D. Gusfield,1997
3. Aho, A., Hopcroft, J., Ullman, J.: Data structures and algorithms. Addison-Wesley, Reading (1983)
4. Smith, T., Waterman, M.: Identification of common molecular subsequences. Journal of Molecular Biology 147(1), 195–197 (1981)
5. Bergeroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings of SPIRE 2000 – 7th International Symposium on String Processing and Information Retrieval, pp. 39–48. IEEE press, Los Alamitos (2000)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献