Position heaps for parameterized strings
From MaRDI portal
Abstract: We propose a new indexing structure for parameterized strings, called parameterized position heap. 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. 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 size. We also show that by using parameterized position heap, we can find all occurrences of a pattern in the text in linear time with respect to the product of the pattern size and the alphabet size.
Recommendations
Cited in
(8)- The parameterized position heap of a trie
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches
- On-line construction of position heaps
- New algorithms for position heaps
- Computing the parameterized Burrows-Wheeler transform online
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
- Efficient parameterized pattern matching in sublinear space
- Breaking a barrier in constructing compact indexes for parameterized pattern matching
This page was built for publication: Position heaps for parameterized strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5110872)