Author:
Mayerhofer Jonas,Kirchweger Markus,Huber Marc,Raidl Günther
Publisher
Springer International Publishing
Reference23 articles.
1. Barone, P., Bonizzoni, P., Vedova, G.D., Mauri, G.: An approximation algorithm for the shortest common supersequence problem: an experimental analysis. In: Proceedings of the 2001 ACM Symposium on Applied Computing, p. 56–60. ACM (2001)
2. Lecture Notes in Computer Science;C Blum,2007
3. Lecture Notes in Computer Science;C Blum,2007
4. Branke, J., Middendorf, M.: Searching for shortest common supersequences by means of a heuristic-based genetic algorithm. In: Proceedings of the Second Nordic Workshop on Genetic Algorithms, pp. 105–113. University of Vaasa, Finland (1996)
5. Lecture Notes in Computer Science;C Cotta,2005