Induced Suffix Sorting

Construction of Fundamental Data Structures for StringsSpringerBriefs in Computer Science(2020)

引用 0|浏览2
暂无评分
摘要
Suffix sorting is one of the most important tasks in string processing. In the past two decades more than 20 suffix sorting algorithms have been proposed. To date, the fastest alternatives to compute the suffix array are based on the induced sorting technique. In this chapter, we present a brief history of suffix sorting, we review important induced sorting algorithms, and we detail algorithms SAIS (Nong et al., 2011) and SACA-K (Nong, 2013), which are the basis of the algorithms introduced in Chaps. 4, 6, and 5.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要