Basic_KMP_SIAM_JNL_Comp_77_KMP_string_matching.pdf

Basic_KMP_SIAM_JNL_Comp_77_KMP_string_matching.pdf

ID:34165821

大小:2.97 MB

页数:28页

时间:2019-03-03

Basic_KMP_SIAM_JNL_Comp_77_KMP_string_matching.pdf_第1页
Basic_KMP_SIAM_JNL_Comp_77_KMP_string_matching.pdf_第2页
Basic_KMP_SIAM_JNL_Comp_77_KMP_string_matching.pdf_第3页
Basic_KMP_SIAM_JNL_Comp_77_KMP_string_matching.pdf_第4页
Basic_KMP_SIAM_JNL_Comp_77_KMP_string_matching.pdf_第5页
资源描述:

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

1、SIAMJ.COMPUT.Vol.6,No.2,June1977FASTPATTERNMATCHINGINSTRINGS*DONALDE.KNUTHf,JAMESH.MORRIS,JR.:l:ANDVAUGHANR.PRATTAbstract.Analgorithmispresentedwhichfindsalloccurrencesofone.givenstringwithinanother,inrunningtimeproportionaltothesumofthelengthsofthestrings.Theconstantofproportionalityislowenoughto

2、makethisalgorithmofpracticaluse,andtheprocedurecanalsobeextendedtodealwithsomemoregeneralpattern-matchingproblems.Atheoreticalapplicationofthealgorithmshowsthatthesetofconcatenationsofevenpalindromes,i.e.,thelanguage{can}*,canberecognizedinlineartime.Otheralgorithmswhichrunevenfasterontheaveragear

3、ealsoconsidered.Keywords,pattern,string,text-editing,pattern-matching,triememory,searching,periodofastring,palindrome,optimumalgorithm,Fibonaccistring,regularexpressionText-editingprogramsareoftenrequiredtosearchthroughastringofcharacterslookingforinstancesofagiven"pattern"string;wewishtofindallpo

4、sitions,orperhapsonlytheleftmostposition,inwhichthepatternoccursasacontiguoussubstringofthetext.Forexample,caenarycontainsthepatternen,butwedonotregardcanaryasasubstring.Theobviouswaytosearchforamatchingpatternistotrysearchingateverystartingpositionofthetext,abandoningthesearchassoonasanincorrectc

5、haracterisfound.Butthisapproachcanbeveryinefficient,forexamplewhenwearelookingforanoccurrenceofaaaaaaabinaaaaaaaaaaaaaab.Whenthepatternisa"bandthetextisa2"b,wewillfindourselvesmaking(n+1)comparisonsofcharacters.Furthermore,thetraditionalapproachinvolves"backingup"theinputtextaswegothroughit,andthi

6、scanaddannoyingcomplicationswhenweconsiderthebufferingoperationsthatarefrequentlyinvolved.Inthispaperwedescribeapattern-matchingalgorithmwhichfindsalloccurrencesofapatternoflengthrnwithinatextoflengthninO(rn+n)unitsoftime,without"backingup"theinputtext.ThealgorithmneedsonlyO(m)locationsofinternalm

7、emoryifthetextisreadfromanexternalfile,andonlyO(logm)unitsoftimeelapsebetweenconsecutivesingle-characterinputs.Alloftheconstantsofproportionalityimpliedbythese"O"formulasareindependentofthealphabetsize.*Receivedb

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

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

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