IMPLEMENTASI STRING MATCHING DENGAN ALGORITMA BOYER-MOORE UNTUK MENENTUKAN TINGKAT KEMIRIPAN PADA PENGAJUAN JUDUL SKRIPSI/TA MAHASISWA (STUDI KASUS: UNIVERSITAS XYZ)
DOI:
https://doi.org/10.31598/sintechjournal.v4i1.699Keywords:
boyer-moore, thesis, string matchingAbstract
In determining the research topic as well as the title for the Thesis / TA, it is possible that there will be a similarity in the title between one student and another, whether intentionally or unintentionally. For this reason, the Study Program must check the titles submitted by students, so as to avoid indications of similar titles and indications of plagiarism. Efforts that can be made to make it easier to check the Thesis title are by performing string matching on the text on the title that will be submitted by students. One of the string matching algorithms is Boyer-Moore. Boyer-Moore, who made the match starting from the rightmost character then left based on the value of the occurrence heuristic (HO) and match heuristic (MH) in determining the shift. This research produces a system that is able to determine the similarity of the proposed Thesis titles based on the existing title repositories. From the results of testing the processing time by entering 100 and its multiples show that the Boyer-Moore algorithm is able to match quickly. The results also showed that the more data the more time it took, but the average increase in time only increased by 34%.
Downloads
References
W. Astuti, “Analisis String Matching Pada Judul Skripsi Dengan Algoritma Knuth-Morris Pratt (KMP),” Ilk. J. Ilm., vol. 9, no. 2, pp. 167–172, 2017.
S. Hadi, “Pemeriksaan Keabsahan Data Penelitian Kualitatif Pada Skripsi,” J. Ilmu Pendidik. Univ. Negeri Malang, vol. 22, no. 1, pp. 74–79, 2016.
Z. A. Matondang, “Implementasi Algoritma String Matching Pencarian Kata Dari Makna Rambu Lalulintas Berbasis Android,” J. Sist. Inf. Kaputama, vol. 2, no. 1, pp. 101–106, 2018.
F. T. Waruwu and R. Mandala, “Perbandingan Algoritma Knuth Morris Pratt dan Boyer Moore Dalam Pencocokan String Pada Aplikasi Kamus Bahasa Nias,” J. Ilm. INFOTEK, vol. 1, no. 1, pp. 36–43, 2016.
R. I. Borman and A. Pratama, “Penerapan String Matching Dengan Algoritma Boyer Moore Pada Aplikasi Font Italic Untuk Deteksi Kata Asing,” J. Teknoinfo, vol. 10, no. 2, pp. 1–5, 2016.
E. Rahmanita, “Pencarian String Menggunakan Algoritma Boyer Moore Pada Dokumen,” J. Ilm. NERO, vol. 1, no. 1, pp. 15–26, 2014.
R. I. Darmawan, A. H. Setianingrum, and A. Arini, “Implementasi Algoritma Boyer Moore Pada Aplikasi Kamus Istilah Kebidanan Berbasis Web,” QUERY J. Sist. Inf., vol. 02, no. 01, pp. 53–62, 2018.
A. Fau, Mesran, and G. L. Ginting, “Analisa Perbandingan Boyer Moore Dan Knuth Morris Pratt Dalam Pencarian Judul Buku Menerapkan Metode Perbandingan Eksponensial ( Studi Kasus : Perpustakaan STMIK Budi Darma ),” J. Times (Technology Informatics Comput. Syst., vol. 6, no. 1, pp. 12–22, 2017.
V. Sagita and M. I. Prasetiyowati, “Studi Perbandingan Implementasi Algoritma Boyer-Moore, Turbo Boyer-Moore, dan Tuned Boyer-Moore dalam Pencarian String,” J. Ultim., vol. 5, no. 1, pp. 31–37, 2013.
Y. Ardi, D. Andreswari, and Y. Setiawan, “Rancang Bangun Aplikasi Kamus Istilah Kedokteran Dengan Menggunakan Algoritma Boyer-Moore Berbasis Android,” J. Rekursif, vol. 5, no. 3, pp. 346–359, 2017.
T. Gumelar, R. Astuti, and A. T. Sunarni, “Sistem Penjualan Online Dengan Metode Extreme Programming,” J. Telemat., vol. 9, no. 2, pp. 87–90, 2017.
R. I. Borman, A. T. Priandika, and A. R. Edison, “Implementasi Metode Pengembangan Sistem Extreme Programming ( XP ) pada Aplikasi Investasi Peternakan Implementation of Extreme Programming ( XP ) System Development Method in Livestock Investment Aplication,” JUSTIN (Jurnal Sist. dan Teknol. Informasi), vol. 8, no. 3, pp. 272–277, 2020.
I. G. N. Suryantara, “Merancang Applikasi dengan Metodologi Extreme Programming.” PT. Elex Media Komputindo, Jakarta, 2017.
L. Rusdiana, “Extreme Programming untuk rancang bangun aplikasi pengelolaan surat keterangan kependudukan,” Regist. J. Ilm. Teknol. Sist. Inf., vol. 4, no. 1, p. 49, 2018.
M. Melinda, R. I. Borman, and E. R. Susanto, “Rancang Bangun Sistem Informasi Publik Berbasis Web (Studi Kasus : Desa Durian Kecamatan Padang Cermin Kabupaten Pesawaran),” J. Tekno Kompak, vol. 11, no. 1, p. 1, 2018.
A. E. Kumala, R. I. Borman, and P. Prasetyawan, “Sistem Informasi Monitoring Perkembangan Sapi Di Lokasi Uji Performance (Studi Kasus : Dinas Peternakan Dan Kesehatan Hewan Provinsi Lampung),” J. Tekno Kompak, vol. 12, no. 1, p. 5, 2018.
I. J. Sinaga, R. C. G. I. Kembaren, D. M. Br Bangun, and N. Marbun, “Penerapan Algoritma Boyer Moore Pada Aplikasi Filosofer Berbasis Website,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 3, no. 1, pp. 436–438, 2019.
Ahmad, I., Sulistiani, H. and Saputra, H., 2018. The Application Of Fuzzy K-Nearest Neighbour Methods for A Student Graduation Rate. Indonesian Journal of Artificial Intelligence and Data Mining, 1(1), pp.47-52.
W. D.Widodo and I. Ahmad, “Penerapan Algoritma A Star (A*) pada Game Petualangan Labirin Berbasis Android,” Khazanah Inform. J. Ilmu Komput. dan Inform., vol. 3, no. 2, p. 57, 2018.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 Imam Ahmad, Rohmat Indra Borman, Gavan Gorbi Caksana, Jafar Fakhrurozi
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Copyright in each article belongs to the author.
- The authors admit that SINTECH Journal as a publisher who published the first time under
Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) License. - Authors can include writing separately, regulate distribution of non-ekskulif of manuscripts that have been published in this journal into another version (eg sent to respository institution author, publication into a book, etc.), by recognizing that the manuscripts have been published for the first time in SINTECH Journal
1.png)
