Search Applications Based Data Analysis Method Boyer Moore

Mulyana A, Purwanto I


Can not be denied the technology has evolved very fast today. Almost all modern human use of technology to facilitate the work and life. Each technology has a storage type that is different for each of the data, but the text remains the main form of data storage (Purwoko, 2006). Problems string searching the data store is to find some characters(pattern)in a large amount of text (Hartayo Vembrina, & Meilana, 2011). It can be concluded that the search string or string searching is the search for a pattern of text. Often operating in the text search process involves the emergence of a string, and location of the text in question (Sulistyo, 2006). Because it was the search string is one thing that is needed primarily in search of data. Boyer-Moore algorithm is a string searching algorithm, published by Robert S. Boyer and J. Strother Moore in 1977. Boyer-Moore algorithm is considered to have the best results in practice this algorithm, amatching algorithm moves string on directions right to left

Full Text:



Anonim , Algoritma Tuned boyer moore ,

bm.html,diakses pada 10 Februari 2017.

Anonim, Algoritma boyer-moore ,

moore_7.html?m+=1,diakses pada 10 Februari 2017.

Anonim, Algoritma zhu takaoka,

chaptr%2011.pdf diakses, pada 11 Januari 2017.

Anonim, Aplikasi


Anonim Data,


Purwoko, 2006 penyimpanan data , h 1-wm.pdf

diakss pada 11 Februari 2017.

Sulistyo, 2006 Operasi teks, 1-wm.pdf, diakss pada

Februari 2017.

Hartoyo, Vembrina, & Meilana, 2011 Permasalahan string searching , http://library 1-wm.pdf, diakss pada 13 Februari 2 017.

Wikipedia, Algoritma boyer-moore https// 10 Februari 2017.

Jiang dan Zheng Ren Siemens AG, A Suffix Tree Based Handwritten Chinese Address

Recognition System dari Xiaoqing Ding Ninth International Conference on Document

Analysis and Recognition IEEE 0-7695-2822-8

Chetan Sharma dan Rinku dari Chitkara University, Himachal Pradesh INDIA. Problem in

Deterministic Turing Machine Accepting Context Sensitive Language, Context Free Language

or Regular Language 2nd International Conference on Computing for Sustainable Global

Development (INDIACom 978-9-3805-4416-8/15 2015 IEEE.

Rim Attafi dan Nadia Zanzouri Université de Tunis El Manar/ Tunis-Tunisia Bond Graph

Modeling and State Estimation of Stringing Machine 7th International Conference on

Modelling, Identification and Control (ICMIC 2015) 978-0-9567157-5-3 © 2014 IEEE.


  • There are currently no refbacks.

International Conference on Engineering and Technology Development (ICETD)
Bandar Lampung University
ISSN: 2301-5690