Improved Algorithm of Approximate Chinese String Matching
Lixin Fan · Computer Engineering and Applications Journal · 2006
Though BPM-BM has achieved good performance especially in matching of Chinese characters,the worst case time is O( +nm).In this paper,we present a improved algorithm IBPM-BM,which can achieve good performance closed to BPM-BM in practice,and obtain O( +n) worst case time.