Perbandingan Algoritma String Matching Not So Naive dan Skip Search Pada Platform Android
DAFTAR PUSTAKA
Alapati, K. P. & Mannava. V. 2011. An GUI Based Implementation of Pattern
Matching Algorithms. International Journal of System And Technologies,
4(2): 207-215.
Bhandari, J. & Kumar, A. 2013. A Correlation Analysis of Suffix to Prefix rule,
Two Window Rule and Non-Tandem Rule of Exact String Matching
Algorithms. Proc. Of Int. Conf. On Advances in Computer Science, pp. 330335
Cantone, D. & Faro, S. 2004. Searching for a subtring with constant extra space
complexity. In Ferragina, P. & Grossi, R (Eds.), Proceedings of The
International Conference on FUN with Algorithms (FUN 2004), pp. 181131
Charas, C. & Lecroq, T, 2004. Handbook of Exact String-Matching Algorithms.
King's College London Publications.
Charras, C., Lecroq, T., & Pehoushek, J. D. 1998. A very fast string matching
algortihm for small alphabets and long patterns. Proceedings of the 9th
Annual Symposium on Combinatorial Pattern Matching, Piscataway, New
Jersey, pp. 55-64
Cormen, T.H, Leiserson, C.E, Rivest, R.L. & Stein, C. 2009. Introduction to
Algorithms. 3th Edition. The MIT Press:England.
Kamus Besar Bahasa Indonesia. (Online) http://www.kbbi.web.id (11 Maret 2016)
Naser, M. A. 2010. Parallel Quick-Skip Search Hybird Algorithm For The Exact
String Matching Problem. Master Thesis, Universiti Sains Malaysia, pp. 1819.
Naser, M. A., Rashid, N. A., & Aboalmaaly, M.F. 2012. Quick-Skip Search Hybird
Algorithm for the Exact String Matching Problem. International Journal of
Computer Theory and Engineering, 4(2): 259-260.
National Institute of Standards and Technology. Dictionary of Algorithms and Data
Structures (Online) http://www.nist.gov/dads/ (11 Maret 2016)
Universitas Sumatera Utara
67
Nugraha, D.W. 2012. Penerapan kompleksitas waktu Algoritma Prim untuk
menghitung kemampuan komputer dalam melaksanakan perintah. Jurnal
Ilmiah Foristek 2(2):196-197.
Subandijo. 2011. Efisiensi Algoritma dan Notasi O-besar. Jurnal ComTech
2(2):850-858.
Syaroni, M. & Munir, R. 2005. Pencocokan String Berdasarkan Kemiripan Ucapan
(Phonetic String Matching) dalam Bahasa Inggris. Prosiding Seminar
Nasional: SNATI UII, Yogyakarta, 18 Juni 2005. pp. 1-6.
Whitten, J.L., Bentley, L.D. & Dittman, K.C. 2004. Metode Desain & Analisis
Sistem. Terjemahan TIM Penerjemah ANDI. ANDI : Yogyakarta.
Zarlis, M. & Handrizal. 2008. Algoritma & Pemrograman : Teori dan Pratik dalam
Pascal. Medan: USU PRESS.
Universitas Sumatera Utara
Alapati, K. P. & Mannava. V. 2011. An GUI Based Implementation of Pattern
Matching Algorithms. International Journal of System And Technologies,
4(2): 207-215.
Bhandari, J. & Kumar, A. 2013. A Correlation Analysis of Suffix to Prefix rule,
Two Window Rule and Non-Tandem Rule of Exact String Matching
Algorithms. Proc. Of Int. Conf. On Advances in Computer Science, pp. 330335
Cantone, D. & Faro, S. 2004. Searching for a subtring with constant extra space
complexity. In Ferragina, P. & Grossi, R (Eds.), Proceedings of The
International Conference on FUN with Algorithms (FUN 2004), pp. 181131
Charas, C. & Lecroq, T, 2004. Handbook of Exact String-Matching Algorithms.
King's College London Publications.
Charras, C., Lecroq, T., & Pehoushek, J. D. 1998. A very fast string matching
algortihm for small alphabets and long patterns. Proceedings of the 9th
Annual Symposium on Combinatorial Pattern Matching, Piscataway, New
Jersey, pp. 55-64
Cormen, T.H, Leiserson, C.E, Rivest, R.L. & Stein, C. 2009. Introduction to
Algorithms. 3th Edition. The MIT Press:England.
Kamus Besar Bahasa Indonesia. (Online) http://www.kbbi.web.id (11 Maret 2016)
Naser, M. A. 2010. Parallel Quick-Skip Search Hybird Algorithm For The Exact
String Matching Problem. Master Thesis, Universiti Sains Malaysia, pp. 1819.
Naser, M. A., Rashid, N. A., & Aboalmaaly, M.F. 2012. Quick-Skip Search Hybird
Algorithm for the Exact String Matching Problem. International Journal of
Computer Theory and Engineering, 4(2): 259-260.
National Institute of Standards and Technology. Dictionary of Algorithms and Data
Structures (Online) http://www.nist.gov/dads/ (11 Maret 2016)
Universitas Sumatera Utara
67
Nugraha, D.W. 2012. Penerapan kompleksitas waktu Algoritma Prim untuk
menghitung kemampuan komputer dalam melaksanakan perintah. Jurnal
Ilmiah Foristek 2(2):196-197.
Subandijo. 2011. Efisiensi Algoritma dan Notasi O-besar. Jurnal ComTech
2(2):850-858.
Syaroni, M. & Munir, R. 2005. Pencocokan String Berdasarkan Kemiripan Ucapan
(Phonetic String Matching) dalam Bahasa Inggris. Prosiding Seminar
Nasional: SNATI UII, Yogyakarta, 18 Juni 2005. pp. 1-6.
Whitten, J.L., Bentley, L.D. & Dittman, K.C. 2004. Metode Desain & Analisis
Sistem. Terjemahan TIM Penerjemah ANDI. ANDI : Yogyakarta.
Zarlis, M. & Handrizal. 2008. Algoritma & Pemrograman : Teori dan Pratik dalam
Pascal. Medan: USU PRESS.
Universitas Sumatera Utara