Survey over pattern string match algorithm[6 items updated && to be continued]
2008-03-16 21:21 老博客哈 阅读(1305) 评论(4) 编辑 收藏 举报
1. BM算法
R S Boyer, J S Moo re. A fast string searching algorithm. Communications of the ACM , 1977, 20 (10) : 762 - 772.
http://www.cs.utexas.edu/~moore/publications/fstrpos.pdf
2. QS算法 MS算法 OM算法
Sunday D M. A very fast substring search algorithm [J ]. Commun ACM , 1990, 33 (8) : 132- 142.
http://delivery.acm.org/10.1145/80000/79184/p132-sunday.pdf?key1=79184&key2=8561485021&coll=GUIDE&dl=GUIDE&CFID=59816834&CFTOKEN=49045422
3. Hash判断一个串是否为另外一个串的子串
Harrison, M.C. Implementation of the substring test by hashing , Comm. ACM , 1971, 777-779
http://portal.acm.org/ft_gateway.cfm?id=362934&type=pdf&coll=GUIDE&dl=&CFID=59935127&CFTOKEN=56312585
4. DFSA算法
Aho AV , Corasick M J. Efficient string matching: an aid to bibliographic search [J ]. Communication of the ACM , 1975, 18 (6) : 333～ 340
http://portal.acm.org/ft_gateway.cfm?id=360855&type=pdf&coll=GUIDE&dl=GUIDE,&CFID=60102753&CFTOKEN=28811006
5. Rabin-Karp 算法
RM Karp, MO Rabin - An Efficient randomized pattern-matching algorithms, JRD. IBM, 1987,249-260
http://www.research.ibm.com/journal/rd/312/ibmrd3102P.pdf
6. FS算法
FAN Jang2jong, SUKeh2yih. An efficient algorithm for match multiple patterns [ J ]. IEEE Trans on Knowledge and Data Engineering, 1993, 5 (2) : 339- 351.
http://ieeexplore.ieee.org/iel3/69/5754/00219740.pdf?tp=&isnumber=&arnumber=219740
R S Boyer, J S Moo re. A fast string searching algorithm. Communications of the ACM , 1977, 20 (10) : 762 - 772.
http://www.cs.utexas.edu/~moore/publications/fstrpos.pdf
2. QS算法 MS算法 OM算法
Sunday D M. A very fast substring search algorithm [J ]. Commun ACM , 1990, 33 (8) : 132- 142.
http://delivery.acm.org/10.1145/80000/79184/p132-sunday.pdf?key1=79184&key2=8561485021&coll=GUIDE&dl=GUIDE&CFID=59816834&CFTOKEN=49045422
3. Hash判断一个串是否为另外一个串的子串
Harrison, M.C. Implementation of the substring test by hashing , Comm. ACM , 1971, 777-779
http://portal.acm.org/ft_gateway.cfm?id=362934&type=pdf&coll=GUIDE&dl=&CFID=59935127&CFTOKEN=56312585
4. DFSA算法
Aho AV , Corasick M J. Efficient string matching: an aid to bibliographic search [J ]. Communication of the ACM , 1975, 18 (6) : 333～ 340
http://portal.acm.org/ft_gateway.cfm?id=360855&type=pdf&coll=GUIDE&dl=GUIDE,&CFID=60102753&CFTOKEN=28811006
5. Rabin-Karp 算法
RM Karp, MO Rabin - An Efficient randomized pattern-matching algorithms, JRD. IBM, 1987,249-260
http://www.research.ibm.com/journal/rd/312/ibmrd3102P.pdf
6. FS算法
FAN Jang2jong, SUKeh2yih. An efficient algorithm for match multiple patterns [ J ]. IEEE Trans on Knowledge and Data Engineering, 1993, 5 (2) : 339- 351.
http://ieeexplore.ieee.org/iel3/69/5754/00219740.pdf?tp=&isnumber=&arnumber=219740
