1. Chimani, M., Woste, M., & Böcker, S. (2011) A closer look at the closest string and closest substring problem. In: Proceedings of the Meeting on Algorithm Engineering & Expermiments (pp. 13–24).
2. Della Croce, F., & Salassa, F. (2012). Improved lp-based algorithms for the closest string problem. Computers & Operations Research, 39(3), 746–749.
3. Deng, X., Li, G., Li, Z., Ma, B., & Wang, L. (2003). Genetic design of drugs without side-effects. SIAM Journal on Computing, 32(4), 1073–1090.
4. Faro, S., & Pappalardo, E. (2010). Ant-csp: An ant colony optimization algorithm for the closest string problem. In Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science (Vol. 5901, pp. 370–381).
5. Gamrath, G., Fischer, T., Gally, T., Gleixner, A.M., Hendel, G., Koch, T., Maher, S.J., Miltenberger, M., Müller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schenker, S., Schwarz, R., Serrano, F., Shinano, Y., Vigerske, S., Weninger, D., Winkler, M., Witt, J.T., & Witzig, J. (2016). The scip optimization suite 3.2. Tech. Rep. 15-60, ZIB, Berlin.