Reference Mobile Forensic Dalam Menemukan Sms Yang Telah Dihapus Pada Handphone Android Dengan Menggunakan Algoritma BoyerMoore
70
DAFTAR PUSTAKA
Bhandari, J. & Kumar,A. 2013. Analysis of Various Rules of Exact String Matching
Algorithms. International Journal of Applied Research and Studies (iJARS)
2(10): 1 - 25.
Bi, C. 2009.Research and Application of SQLite Embedded Database Technology.
WSEAS Transactions on Computers 8(1): 83 - 92.
Boyer,R.S. & Moore,J.S. 1977. A Fast String Searching Algorithm. Communications
of the ACM 20(10): 762 - 772.
Cantone, D., Cristofaro, S. & Faro, S. 2010. A Space-Efficient Implementation of The
Good- Suffix Heuristic. Proceedings of PSC 2010, pp. 63 - 75
Carrier, B. 2003. Defining Digital Forensic Examination and Analysis Tools Using
Abstraction Layers. International Journal of Digital Evidance 1(4): 1 - 12.
Casey, E. 2011. Digital Evidence and Computer Crime: Forensic Science, Computers
and the Internet. 3rd Edition. Elsevier: Waltham.
Choudhary, R., Rasool, A. & Khare, N. 2012. Variation of Boyer-Moore String
Matching Algorithm : A Comparative Analysis. International Journal of
Computer Science dan Information Security 10(2): 95 - 101.
Crochemore, M. & Lecroq, T. 1996. Pattern Matching and Text Compression
Algorithms. ACM Computing Surveys (CSUR) 28(1): 39 - 41.
Dermawan, H. 2001. Membandingkan Kecepatan Algoritma Brute-Force(BF),
Algoritma Knuth-Morris-Pratt(KMP) dan Algoritma Boyer-Moore(BM).
Skripsi. Universitas Kristen Duta Wacana.
71
Effendi, D., Hartono, T. & Kurnaedi, A. 2011. Penerapan string matching
menggunakan algoritma Boyer-Moore pada translator bahasa Pascal ke bahasa
C. Majalah Ilmiah UNIKOM, 11(2): 262 - 275.
Hoog, A. 2011. Android Forensic: Investigation, Analysis, and Mobile Security for
Google Android. Elsevier: Waltham.
Knuth, D.E., Morris, JR.J.H. & Pratt, V.R. 1977. Fast Pattern Matching in Strings.
SIAM Journal on Computing 6(1): 323 - 350.
Lecroq, T. 1992. A variation on the Boyer-Moore algorithm. Theoritical Computer
Science 92(1): 119 - 144.
Lessard, J. & Kessler, G.C. 2010. Android Forensic: Simplifying Cell Phone
Examinations. Journal of Small Scale Digital Evidance Forensics Journal
4(1): 1 - 2
Marshall, A.M. 2008. Digital Forensic, Digital Evidance in Criminal Investigation.
John Wiley & Sons, Ltd.: West Sussex.
Navarro, G. 2001. A Guided Tour to Approximate String Matching. Journal of ACM
Computing Surveys (CSUR) 33(1): 31 - 88.
Patrick, A.V.H. & Geoff, R.D. 1980. Approximate String Matching. Journal ACM
Computing Surveys (CSUR) 12(4): 381 - 402
Raharjo, B. 2013. Sekilas Mengenai Forensika Digital. Jurnal Sosioteknologi 29(12):
384 - 387.
Singla, N. & Garg, D. 2012. String Matching Algorithms and their Applicability in
various Applications. International Journal of Soft Computing and
Engineering (IJSCE). 1(6): 218 - 222
72
Stahlberg, P., Miklau, G. & Levine, B.N. 2007. Threats to Privacy in the Forensic
Analysis of
Database Systems. Proceedings of the 2007 ACM SIGMOD
International Conference on Management of Data, pp. 91 - 102.
Tenlima, Y.A. 2009. Pencocokan string Pada Dokumen Teks Menggunakan
Algoritma Knuth Morris Pratt. Skripsi. Universitas Kristen Duta Wacana.
Undang - undang nomor 11 tahun 2008, tentang informasi dan transaksi elektronik.
2008. Departement Komunikasi dan Informasi: Jakarta.
Yoon, H. 2012. A Study on the Performance of Android Platform. International
Journal on Computer Science and Engineering (IJCSE) 4(4): 532 - 537
Zareen, A. & Baig, S. 2010. Mobile Phone Forensics: Challenges, Analysis and Tools
Classification. Proceedings of the 2010 International Workshop on Systematic
Approaches to Digital Forensic Engineering, pp. 47-55.
DAFTAR PUSTAKA
Bhandari, J. & Kumar,A. 2013. Analysis of Various Rules of Exact String Matching
Algorithms. International Journal of Applied Research and Studies (iJARS)
2(10): 1 - 25.
Bi, C. 2009.Research and Application of SQLite Embedded Database Technology.
WSEAS Transactions on Computers 8(1): 83 - 92.
Boyer,R.S. & Moore,J.S. 1977. A Fast String Searching Algorithm. Communications
of the ACM 20(10): 762 - 772.
Cantone, D., Cristofaro, S. & Faro, S. 2010. A Space-Efficient Implementation of The
Good- Suffix Heuristic. Proceedings of PSC 2010, pp. 63 - 75
Carrier, B. 2003. Defining Digital Forensic Examination and Analysis Tools Using
Abstraction Layers. International Journal of Digital Evidance 1(4): 1 - 12.
Casey, E. 2011. Digital Evidence and Computer Crime: Forensic Science, Computers
and the Internet. 3rd Edition. Elsevier: Waltham.
Choudhary, R., Rasool, A. & Khare, N. 2012. Variation of Boyer-Moore String
Matching Algorithm : A Comparative Analysis. International Journal of
Computer Science dan Information Security 10(2): 95 - 101.
Crochemore, M. & Lecroq, T. 1996. Pattern Matching and Text Compression
Algorithms. ACM Computing Surveys (CSUR) 28(1): 39 - 41.
Dermawan, H. 2001. Membandingkan Kecepatan Algoritma Brute-Force(BF),
Algoritma Knuth-Morris-Pratt(KMP) dan Algoritma Boyer-Moore(BM).
Skripsi. Universitas Kristen Duta Wacana.
71
Effendi, D., Hartono, T. & Kurnaedi, A. 2011. Penerapan string matching
menggunakan algoritma Boyer-Moore pada translator bahasa Pascal ke bahasa
C. Majalah Ilmiah UNIKOM, 11(2): 262 - 275.
Hoog, A. 2011. Android Forensic: Investigation, Analysis, and Mobile Security for
Google Android. Elsevier: Waltham.
Knuth, D.E., Morris, JR.J.H. & Pratt, V.R. 1977. Fast Pattern Matching in Strings.
SIAM Journal on Computing 6(1): 323 - 350.
Lecroq, T. 1992. A variation on the Boyer-Moore algorithm. Theoritical Computer
Science 92(1): 119 - 144.
Lessard, J. & Kessler, G.C. 2010. Android Forensic: Simplifying Cell Phone
Examinations. Journal of Small Scale Digital Evidance Forensics Journal
4(1): 1 - 2
Marshall, A.M. 2008. Digital Forensic, Digital Evidance in Criminal Investigation.
John Wiley & Sons, Ltd.: West Sussex.
Navarro, G. 2001. A Guided Tour to Approximate String Matching. Journal of ACM
Computing Surveys (CSUR) 33(1): 31 - 88.
Patrick, A.V.H. & Geoff, R.D. 1980. Approximate String Matching. Journal ACM
Computing Surveys (CSUR) 12(4): 381 - 402
Raharjo, B. 2013. Sekilas Mengenai Forensika Digital. Jurnal Sosioteknologi 29(12):
384 - 387.
Singla, N. & Garg, D. 2012. String Matching Algorithms and their Applicability in
various Applications. International Journal of Soft Computing and
Engineering (IJSCE). 1(6): 218 - 222
72
Stahlberg, P., Miklau, G. & Levine, B.N. 2007. Threats to Privacy in the Forensic
Analysis of
Database Systems. Proceedings of the 2007 ACM SIGMOD
International Conference on Management of Data, pp. 91 - 102.
Tenlima, Y.A. 2009. Pencocokan string Pada Dokumen Teks Menggunakan
Algoritma Knuth Morris Pratt. Skripsi. Universitas Kristen Duta Wacana.
Undang - undang nomor 11 tahun 2008, tentang informasi dan transaksi elektronik.
2008. Departement Komunikasi dan Informasi: Jakarta.
Yoon, H. 2012. A Study on the Performance of Android Platform. International
Journal on Computer Science and Engineering (IJCSE) 4(4): 532 - 537
Zareen, A. & Baig, S. 2010. Mobile Phone Forensics: Challenges, Analysis and Tools
Classification. Proceedings of the 2010 International Workshop on Systematic
Approaches to Digital Forensic Engineering, pp. 47-55.