Name
Abstract | ||
|---|---|---|
In this paper, we propose a new indexing structure for parameterized strings, called parameterized linear-size suffix tries, by generalizing linear-size suffix tries for ordinary strings. Two parameterized strings are said to match if there is a bijection between symbols that makes the two coincide. Parameterized linear-size suffix tries are applicable to the parameterized pattern matching problem, which is to decide whether the input text has a substring that matches the input pattern. The size of our proposed structure is linear in the text size, with which our algorithm solves the problem in linear time in the pattern size. Our proposed data structure can be seen as a compacted version of a parameterized suffix trie and an alternative of a parameterized suffix tree. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Data Structures and Algorithms | Journal |
Volume | Citations | PageRank |
abs/1902.00216 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katsuhito Nakashima | 1 | 0 | 0.68 |
| Diptarama Hendrian | 2 | 0 | 2.37 |
| Ryo Yoshinaka | 3 | 172 | 26.19 |
| Ayumi Shinohara | 4 | 936 | 88.28 |