On-line linear time construction of sequential binary suffix trees |
| |
Authors: | Lai Huoyao Liu Gongshen |
| |
Institution: | School of Information Security Engineering,Shanghai Jiaotong Univ.,Shanghai 200240,P.R.China |
| |
Abstract: | 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 operations in construction and keeps the result tree sequential, is proposed. The experiment result shows that both the construction and the matching procedure are more efficient than Ukkonen algorithm. |
| |
Keywords: | suffix tree sequential linear time construction |
本文献已被 维普 万方数据 等数据库收录! |
| 点击此处可从《系统工程与电子技术(英文版)》浏览原始摘要信息 |
| 点击此处可从《系统工程与电子技术(英文版)》下载免费的PDF全文 |