Simpler FM-index for parameterized string matching

Information Processing Letters（2021）

引用 8|浏览15

暂无评分

摘要

•Using ∞ instead of 0 for encoding parameterized strings derives a simpler index.•The presented index consists of only wavelet trees and a range maximum query index.•The index occupies 2n lg σ+2n+o(n) bits with O(lg σ) search time per symbol.

查看译文

关键词

Data structures,Parameterized string matching,Suffix array,Burrows-Wheeler transform,Succinct data structure

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要