Thời gian: 9h30, Thứ 5, ngày 7/6/2018
Địa điểm: Phòng 611- 612, nhà A6, Viện Toán học, 18 Hoàng Quốc Việt.
Tóm tắt: In this paper, based on the concept of the degree of fuzziness proposed by P. T. Huy et al. in 2002, we introduce a flexible approach to design a effective algorithm for exact pattern matching, and compare it with some of the most efficient algorithms, such as AOSO, EBOM, FJS, FSBNDM, HASHq, LBNDM, SA, SBNDM-BMH-SBNDM, SBNDMq, TVSBS. Theoretical analysis and experimental results indicate that in practice our algorithm is fastest in most of the cases of the given patterns and alphabets.