Sastra Ramadanu
STMIK Budi Darma Jln. Sisingamangaraja No. 338

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Perancangan Aplikasi Pencarian File Teks dengan Menggunakan Algoritma Colussi Dan Algoritma Simon Sastra Ramadanu
JURIKOM (Jurnal Riset Komputer) Vol 6, No 1 (2019): Februari 2019
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (257.105 KB) | DOI: 10.30865/jurikom.v6i1.1294

Abstract

String matching is a string processing which is the main requirement in obtaining information in the text that helps humans find information faster because it has an algorithm for searching the string. Search algorithms have advantages and disadvantages in search, matching, speed, accuracy, and others. By performing a performance comparison analysis, it can be seen the speed and accuracy in the search process time and word matching and the percentage of memory used in one process of each of these algorithms. The colussi algorithm is a search that has been specifically determined by the system or algorithm where the colussi algorithm is an improvement of the boyer moore algorithm which is a right-to-left search while simon algorithm is a classic algorithm that is widely known as a method that can identify local similarities ) that is the process of making two nucleotide local sequences or protein sequences where similarities between the two sequences will be seen.