Author:
Asahiro Yuichi,Jansson Jesper,Lin Guohui,Miyano Eiji,Ono Hirotaka,Utashima Tadatoshi
Publisher
Springer International Publishing
Reference24 articles.
1. Adi, S.S., et al.: Repetition-free longest common subsequence. Disc. Appl. Math. 158, 1315–1324 (2010)
2. Aho, A., Hopcroft, J., Ullman, J.: Data Structures and Algorithms. Addison-Wesley, Boston (1983)
3. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403–410 (1990)
4. Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings of SPIRE, pp. 39–48 (2000)
5. Blin, G., Bonizzoni, P., Dondi, R., Sikora, F.: On the parameterized complexity of the repetition free longest common subsequence problem. Info. Proc. Lett. 112(7), 272–276 (2012)