The wide window string matching algorithm
文献类型：期刊论文
| 作者 | He, LT; Fang, BX; Sui, J |
| 刊名 | Theoretical computer science
 |
| 出版日期 | 2005-02-28 |
| 卷号 | 332期号:1-3页码:391-404 |
| 关键词 | Suffix automaton Reverse prefix automaton Bit parallelism Wide window algorithm String matching |
| ISSN号 | 0304-3975 |
| DOI | 10.1016/j.tcs.2004.12.002 |
| 通讯作者 | He, lt(hlt@hit.edu.cn) |
| 英文摘要 | Generally, current string matching algorithms make use of a window whose size is equal to pattern length. in this paper, we present a novel string matching algorithm named ww (for wide window) algorithm, which divides the text into [n/m] overlapping windows of size 2m - 1. in the windows, the algorithm attempts m possible occurrence positions in parallel. it firstly searches pattern suffixes from middle to right with a forward suffix automaton, shifts the window directly when it fails, otherwise, scans the corresponding prefixes backward with a reverse prefix automaton. theoretical analysis shows that ww has optimal time complexity of o(n) in the worst, o(n/m) best and o(n(log(sigma) m)/m) for average case. experimental comparison of ww with existing algorithms validates our theoretical claims for searching long patterns. it further reveals that ww is also efficient for searching short patterns. (c) 2004 elsevier b.v. all rights reserved. |
| WOS研究方向 | Computer Science |
| WOS类目 | Computer Science, Theory & Methods |
| 语种 | 英语 |
| WOS记录号 | WOS:000227578800018 |
| 出版者 | ELSEVIER SCIENCE BV |
| URI标识 | http://www.irgrid.ac.cn/handle/1471x/2377023 |
| 专题 | 中国科学院大学 |
| 通讯作者 | He, LT |
| 作者单位 | 1.Harbin Inst Technol, Res Ctr Comp Network & Informat Secur Technol, Harbin 150001, Peoples R China 2.Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China |
| 推荐引用方式 GB/T 7714 | He, LT,Fang, BX,Sui, J. The wide window string matching algorithm[J]. Theoretical computer science,2005,332(1-3):391-404. |
| APA | He, LT,Fang, BX,&Sui, J.(2005).The wide window string matching algorithm.Theoretical computer science,332(1-3),391-404. |
| MLA | He, LT,et al."The wide window string matching algorithm".Theoretical computer science 332.1-3(2005):391-404. |
入库方式： iSwitch采集
来源：中国科学院大学
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。