arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.00216cs.DS
收藏

参数化字符串线性后缀Tries的扩展

An Extension of Linear-size Suffix Tries for Parameterized Strings

Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara

摘要:

在本文中,我们提出了一个新的索引结构参数化字符串,我们称之为PLST,通过推广线性大小后缀尝试普通字符串。如果在符号集上存在使两个参数化字符串重合的双射,则称这两个参数化字符串匹配。PLST适用于参数化模式匹配问题,即判断输入的参数化文本是否具有与输入的参数化模式匹配的子串。PLST的大小与文本大小成线性关系,利用这一特性,我们的算法在线性时间内解决了模式大小的参数化模式匹配问题。PLST可以被看作是参数化后缀尝试的压缩版本以及线性大小后缀尝试和参数化后缀树的组合。我们的实验表明,PLST是更有效的空间比参数化的后缀树高度重复的字符串。

英文摘要:

In this paper, we propose a new indexing structure for parameterized strings which we call PLSTs, by generalizing linear-size suffix tries for ordinary strings. Two parameterized strings are said to match if there is a bijection on the symbol set that makes the two coincide. PLSTs are applicable to the parameterized pattern matching problem, which is to decide whether the input parameterized text has a substring that matches the input parameterized pattern. The size of PLSTs is linear in the text size, with which our algorithm solves the parameterized pattern matching problem in linear time in the pattern size. PLSTs can be seen as a compacted version of parameterized suffix tries and a combination of linear-size suffix tries and parameterized suffix trees. We experimentally show that PLSTs are more space efficient than parameterized suffix trees for highly repetitive strings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑