AI helps you reading Science
Suffix Trees on Words
Algorithmica, no. 3 (1999): 102-115
EI
Full Text
Abstract
. We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words . This word
suffix
tree represents only the m suffixes that start at word boundaries. These boundaries are determined by delimiters , whose definition depends o...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn