文档介绍：・,,weexploresuffixtreeconstructionalgorithmsoverawidespectnimofdatasourcesandsizes・First,weshowthatonmodernprocessors,acache-efficient algorithmwithO(plexityoutperformsthepopularO(n)Ukkonenalgorithm,evenforin-,thediskI/esthebottleneckineachalgorithm'sperformance・Toaddressthisproblem,wepresentabuffermanagementstrategyfortheO(/?2)algorithm,creatinganewdisk-basedconstructionalgorithmthatscalestosizesmuchlargerthanhavebeenpreviouslydescribedintheliterature・,suchasgenomesandlargesetsofproteinsequences・Manyofthesebiologicaldatasetsaregrowingatexponentialrates—forexample,thesizesofthesequencedatasetsinGenBankhavebeendoublingeverysix-mercialadvantage,theVLDBcopyrightnoticeandthetitleofthepublicationanditsdateappear,,ortorepublish,requiresafeeand/,Toronto,Canada,2004teenmonths[,essoftheseemergingdatabaseapplications・Suffixtreesareversatiledatastructuresthatcanhelpexecutesuchqueriesveryefficiently・Infact,suffixtreesareusefulforsolvingawidevarietyofstringbasedproblems[17].Forinstance,theexactsubstringmatchingproblemcanbesolvedintimeproportionaltothelengthofthequery,