International Journal of Artificial Intelligence and Knowledge Discovery | |
Recent Advancements in String Matching Algorithms: A Study with Result Analysis | |
Ramakrishna kolikipogu1  K. Buchi Raju2  | |
[1] Head, Department of IT,Sridevi Women's Engineering College,;Gokaraju Rangaraju Inst of Engg & Tech,Hyderabad | |
关键词: String matching; information retrieval; Automaton; Heuristic; | |
DOI : | |
学科分类:建筑学 | |
来源: RG Education Society | |
【 摘 要 】
In recent years, string matching problem has found wide application in computer science, information retrieval, molecular biology, genetic engineering, semantics and many other fields. This leads to the researchers to drag themselves for developing better technique. There are various techniques proposed by several researchers to deal with this difficulty. In this work, we reviews typical algorithms and profile their performance under various situations to study the influence of the number, the length, and the character distribution of the signatures on performance. This paper provides various available techniques that are suggested by various authors with its merits and demerits. This survey will help the researchers to develop a better technique in this area of research.
【 授权许可】
Unknown
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201912010161206ZK.pdf | 11KB | download |