Research of BM Algorithm in Character Match

DOI

10.2991/isci-15.2015.93How to use a DOI?

Keywords

character match; BM algorithm; bad sign; good suffix; efficiency.

Abstract

Character match is more and more applied in computer application field. BM algorithm belongs to an algorithm based on bad sign and good suffix rules. It has high match efficiency, which is widely applied. In the paper, some application fields of BM algorithm are firstly analyzed and discussed. Several character match algorithms similar to the BM algorithms are analyzed, then basic concepts of BM algorithm are analyzed in details, calculation method of bad sign shift table and good suffix shift table is designed and implemented, pseudo-code of the algorithm is constructed through the calculation method. A group of data is randomly selected for example analysis finally. Test results show that improved BM algorithm significantly shortens the character matching time and greatly improves efficiency of character match.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Baofeng Zhu
AU  - Bing Zhao
PY  - 2015/01
DA  - 2015/01
TI  - Research of BM Algorithm in Character Match
BT  - Proceedings of the 2015 International Symposium on Computers & Informatics
PB  - Atlantis Press
SP  - 696
EP  - 702
SN  - 2352-538X
UR  - https://doi.org/10.2991/isci-15.2015.93
DO  - 10.2991/isci-15.2015.93
ID  - Zhu2015/01
ER  -