Parameterized position heap is applicable for parameterized pattern matching problem, where the pattern matches a substring of the text if there exists a bijective mapping from the symbols of the pattern to the symbols of the substring.
Feb 8, 2017
The parameterized position heap is a sequence hash tree for the ordered set of prev-encoded [2] suffixes of a parameterized string.
We propose an online construction algorithm of parameterized position heap of a text and show that our algorithm runs in linear time with respect to the text ...
Apr 18, 2017 · The parameterized position heap is a sequence hash tree for the ordered set of prev-encoded [2] suffixes of a parameterized string. We give an ...
In this paper, we present a right-to-left online construction algorithm for parameterized position heaps. For a text string $T$ of length $n$ over two kinds of ...
In this paper, we present a right-to-left online construction algorithm for parameterized position heaps. For a text string T of length n over two kinds of ...
[PDF] Right-to-left Online Construction of Parameterized Position Heaps
www.stringology.org › getfile
[Position Heaps for Parameterized Strings, CPM 2017] proposed an indexing data structure called parameterized position heaps, and gave a left-to- right ...
Diptarama , Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara : Position Heaps for Parameterized Strings. CPM 2017: 8:1-8:13.
We propose a new indexing structure for parameterized strings, called parameterized position heap. Parameterized position heap is applicable for parameterized ...
In this paper, we consider the problem of finding occurrences of a pattern string P in a text T, where preprocessing of T is allowed in order to create a data ...
Missing: Parameterized | Show results with:Parameterized