1. Aho, A.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, pp. 257–300. MIT Press/Elsevier (1990)
2. Blanchette, M., Schwikowski, B., Tompa, M.: An exact algorithm to identify motifs in orthologous sequences from multiple species. In: Proceedings of the Annual International Conference on Computational Molecular Biology, pp. 37–45. ACM Press, New York (2000)
3. Cesati, M., Di Ianni, M.: Parameterized parallel complexity. Technical Report 4(6), Electronic Colloquium on Computational Complexity (ECCC) (1997)
4. Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Information and Control 64(1-3), 2–21 (1985)
5. Monographs in Computer Science;R. Downey,1999