论文部分内容阅读
<正>Suffix trees are the key data structure for text string matching,and are used in wide application areas such as bioinformatics and data compression.Ukkonen algorithm is deeply investigated and a new algorithm,which decreases the number of memory