期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：11
DOI：10.15680/IJIRCCE.2015.0311168
出版社：S&S Publications
摘要：The purpose of this research is to compare a very efficient String matching algorithm known as SA string matching with other familiar string matching algorithms and show that the complexity is much less than all of these algorithms .
关键词：String Matching ; Co mplexity analysis ; Preprocessing time ; Matching time
