1. Bergroth, L., Hakonen, H., Raita, T.: (2002): A survey of longest common subsequence algorithms. In: Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE 2000), pp. 39–48 (2000)
2. Beyer, H.-G., Schwefel, H.-P., Wegener, I.: How to analyze evolutionary algorithms. Theor. Comput. Sci. 287(1), 101–130 (2002)
3. Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O., Jansen, T., Leifhelm, M., Plociennik, K., Röglin, H., Schweer, A., Sudholt, D., Tannenbaum, S., Wegener, I.: Experimental supplements to the theoretical analysis of EAs on problems from combinatorial optimization. In: Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), pp. 21–30 (2004)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
5. DeJong, K.: Evolutionary Computation: A Unified Approach. MIT Press, Cambridge (2006)