FM-Directories: Extending the Burrows-Wheeler Transform for String Labeled Vertex Graphs of (Almost) Arbitrary Topology

2023 Data Compression Conference (DCC)(2023)

引用 0|浏览2
暂无评分
摘要
We introduce an extension of the Burrows-Wheeler transform supporting exact pattern matching on a string graph $G(V,\ E,\ N)$ and yielding polynomial time queries.
更多
查看译文
关键词
Graph indexing,Pattern matching
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要