Fast String Matching algo compare.pdf

Fast String Matching algo compare.pdf

ID:34439642

大小:2.43 MB

页数:10页

时间:2019-03-06

Fast String Matching algo compare.pdf_第1页
Fast String Matching algo compare.pdf_第2页
Fast String Matching algo compare.pdf_第3页
Fast String Matching algo compare.pdf_第4页
Fast String Matching algo compare.pdf_第5页
资源描述:

《Fast String Matching algo compare.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、SHIPPENSBURGUNIVERSITYFastStringMatchingAlgorithmsComparedRabin-Karpvs.Knuth-Morris-Prattvs.Boyer-Moore-HorspoolEricC.Abruzzese4/21/2011TheAlgorithmsKnuth-Morris-PrattReferencesUsedKNUTHD.E.,MORRIS(Jr)J.H.,PRATTV.R.,1977,Fastpatternmatchinginstrings,S

2、IAMJournalonComputing6(1):323-350DescriptionoftheAlgorithmTheKnuth-Morris-Pratt(KMP)algorithmeliminatestheinefficienciesofthebrute-forceapproachbyreducingthewastedinformationobtainedasweperformasearch.TheKMPalgorithmbeginsbypreprocessingthegivenpatter

3、nandcomputinga“failurefunction”(theresultsofwhicharestoredinatable)thatindicatesthelargestshiftusingpreviouslyperformedcomparisons.Essentially,wearecomputingthelengthofthelongestprefixofthepatternthatisalsoasuffixofthesamepattern.Aftercomputingthefail

4、urefunction,wematchthepatternfromrighttoleft(alaHorspool),tothegiventext.Uponobservingamismatch,welookinthetableofcomputedshiftingvaluesandshiftthatmanytotheright.ThisalgorithmisessentiallyanattempttoimproveontheMorris-Prattalgorithmbyincreasingthesiz

5、eofshiftswhenamismatchoccurs.ClaimedEfficiency:O(n+m)Pseudocode(CLanguage):voidpreKmp(char*x,intm,intkmpNext[]){inti,j;i=0;j=kmpNext[0]=-1;while(i-1&&x[i]!=x[j])j=kmpNext[j];i++;j++;if(x[i]==x[j])kmpNext[i]=kmpNext[j];elsekmpNext[i]=j;}}vo

6、idKMP(char*x,intm,char*y,intn){inti,j,kmpNext[XSIZE];/*Preprocessing*/preKmp(x,m,kmpNext);/*Searching*/i=j=0;while(j-1&&x[i]!=y[j])i=kmpNext[i];i++;j++;if(i>=m){OUTPUT(j-i);i=kmpNext[i];}}}Rabin-KarpReferencesUsedKARPR.M.,RABINM.O.,1987,Ef

7、ficientrandomizedpattern-matchingalgorithms.IBMJ.Res.Dev.31(2):249-260.LECROQ,T.,1995,Experimentalresultsonstringmatchingalgorithms,Software-Practice&Experience25(7):727-765.DescriptionoftheAlgorithmTheRabin-Karpalgorithmisoneofrelativeinterestbecause

8、itusestheefficiencyadvantagesofahashtableandappliesthemtostringmatching.Thealgorithmworksbyusinganefficientlycomputable,highlydiscriminatinghashfunctionthatisusedtodeterminehowcloselyrelatedthepatternandthecurrentword(searchwindow)are(essentia

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。