Author:
Djukanovic Marko,Raidl Günther R.,Blum Christian
Publisher
Springer International Publishing
Reference21 articles.
1. Beal, R., Afrin, T., Farheen, A., Adjeroh, D.: A new algorithm for “the LCS problem” with application in compressing genome resequencing data. BMC Genom. 17(4), 544 (2016)
2. Lecture Notes in Computer Science;C Blum,2007
3. Blum, C., Blesa, M.J., López-Ibáñez, M.: Beam search for the longest common subsequence problem. Comput. Oper. Res. 36(12), 3178–3186 (2009)
4. Blum, C., Festa, P.: Longest common subsequence problems. In: Metaheuristics for String Problems in Bioinformatics, chapter 3, pp. 45–60. Wiley (2016)
5. Bonizzoni, P., Della Vedova, G., Mauri, G.: Experimenting an approximation algorithm for the LCS. Discrete Appl. Math. 110(1), 13–24 (2001)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献