1. Amir, A., Nor, I.: Generalized function matching. J. Discrete Algorithms 5(3), 514–523 (2007)
2. Angluin, D.: Finding patterns common to a set of strings (extended abstract). In: Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30-May 2, 1979, Atlanta, GA, USA, pp. 130–141 (1979)
3. Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21(1), 46–62 (1980)
4. Clifford, R., Harrow, A.W., Popa, A., Sach, B.: Generalised matching. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) Proceedings od the 16th International Symposium String Processing and Information Retrieval (SPIRE 2009), Saariselkä, Finland, August 25–27, 2009, Volume 5721 of Lecture Notes in Computer Science, pp. 295–301. Springer, Berlin (2009)
5. Clifford, R., Popa, A.: (In)approximability results for pattern matching problems. In: Holub, J., Zdárek, J. (eds.) Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30–September 1, 2010, pp. 52–62. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague (2010)