1. Amir, A., Paryenty, H., Roditty, L.: Configurations and minority in the string consensus problem. In: String Processing and Information Retrieval, pp. 42–53. Springer, Berlin (2012)
2. Andoni, A., Indyk, P., Patrascu, M.: On the optimality of the dimensionality reduction method. In: 47th Annual IEEE Symposium on Foundations of Computer Science, 2006 (FOCS’06), pp. 449–458. IEEE, New York (2006)
3. Ausiello, G.: Complexity and approximation: Combinatorial optimization problems and their approximability properties. Springer, Berlin (1999)
4. Babaie, M., Mousavi, S.: A memetic algorithm for closest string problem and farthest string problem. In: 18th Iranian Conference on Electrical Engineering (ICEE), pp. 570–575. IEEE, New York (2010)
5. Bahredar, F., Javadi, H., Moghadam, R., Erfani, H., Navidi, H.: A meta heuristic solution for closest substring problem using ant colony system. Adv. Stud. Biol. 2(4), 179–189 (2010)