The parameterized position heap of a trie

DOI10.1007/978-3-030-17402-6_20OpenAlexW2929743393MaRDI QIDQ2294053FDOQ2294053

Authors: Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda 

Publication date: 6 February 2020

Full work available at URL: https://arxiv.org/abs/1903.06289

Recommendations

• Position heaps for parameterized strings
• A framework for dynamic parameterized dictionary matching
• Parameterized DAWGs: efficient constructions and bidirectional pattern searches
• Efficient parameterized string matching
• DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (4)

• Parameterized DAWGs: efficient constructions and bidirectional pattern searches
• Position heaps for Cartesian-tree matching on strings and tries
• Title not available (Why is that?)
• The parameterized suffix tray

This page was built for publication: The parameterized position heap of a trie

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294053)