DAFTAR PUSTAKA
Al-Khamaiseh, K. & Al-Shagarin, S. 2014. A Survey of String Matching Algorithm.
International Journal of Engineering Research and Applications, Vol. 4, No. 7, pp. 114-156.
Berry, T. & Ravindran, S. 2002. Tuning the Zhu-Takaoka String Matching Algorithm and Experimental Results. Kybernetika, Vol. 38, No. 1, pp. 67-80.
Boyer, R. S. & Moore, J. S. 1977. A Fast Searching Algorithm, Communication of the ACM, Vol. 20 No. 10, pp. 762-772.
Coppin, B. 2004. Artificial Intelligence Illuminated, Jones and Bartlett. United State of America.
Crochemore, M. & Lecroq, T. 1997. Tight Bounds on the Complexity of the Apostolico Giancarlo Algorithm. Information Processing Letters.
Crochemore, M., Hancart, C. & Lecroq, T. 2002. A Unifying Look at Apostolico Giancarlo String Matching Algorithm. Journal of Discrete Algorithm Vol. 0
No. 0, pp. 1-18.
Kusumadewi, S. & Purnomo, H. 2005. Penyelesaian Masalah Optimasi Dengan Teknik-Teknik Heuristik. Yogyakarta : Graha Ilmu.
Lecroq, T. 1992. A Variation on the Booyer Moore Algorithm. Theoritical Computer Science 92: 119-144.
Mirabella, F.M. 2012. Variasi-Variasi Algoritma Boyer-Moore dan Perbandingannya Dalam Pencarian String, Makalah IF3051 Strategi Algoritma.
Mukodim, D. 1994. Pengantar Bahasa Rakitan Edisi 1 Cetakan 4. Gunadarma: Jakarta.
Nievergelt, J. 2000. Exhaustive Search, Combinatorial Optimization and Enumeration : Exploring the Potential of Raw Computing Power. SOFSEM, pp. 18-35. Soleh, M.Y., Hartadi, D. & Adventus, W.L. 2010. Strategi Algoritma:Aplikasi
Algoritma KMP dan Boyer-Moore dalam Search Engine. Tugas Besar IF3051, Institut Teknologi Bandung.