The position heap of a trie

Authors:
Yuto Nakashima;Tomohiro I;Shunsuke Inenaga;Hideo Bannai;Masayuki Takeda
Affiliations:
Department of Informatics, Kyushu University, Japan;Department of Informatics, Kyushu University, Japan,Japan Society for the Promotion of Science (JSPS), Japan;Department of Informatics, Kyushu University, Japan;Department of Informatics, Kyushu University, Japan;Department of Informatics, Kyushu University, Japan
Venue:
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Year:
2012

Citing 15
Cited 1

Complete inverted files for efficient text retrieval and analysis

Journal of the ACM (JACM)
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Finding level-ancestors in trees

Journal of Computer and System Sciences
Improved dynamic dictionary matching

Information and Computation
The suffix tree of a tree and minimizing sequential transducers

Theoretical Computer Science
File structures using hashing functions

Communications of the ACM
Fast Incremental Planarity Testing

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The level ancestor problem simplified

Theoretical Computer Science - Latin American theorotical informatics
Maintaining information in fully dynamic trees with top trees

ACM Transactions on Algorithms (TALG)
Linear work suffix array construction

Journal of the ACM (JACM)
Efficient tree pattern matching

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics
Position heaps: A simple and dynamic text indexing data structure

Journal of Discrete Algorithms
On-line construction of position heaps

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval

On-line construction of position heaps

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The position heap is a text indexing structure for a single text string, recently proposed by Ehrenfeucht et al. [Position heaps: A simple and dynamic text indexing data structure, Journal of Discrete Algorithms, 9(1):100-121, 2011]. In this paper we introduce the position heap for a set of strings, and propose an efficient algorithm to construct the position heap for a set of strings which is given as a trie. For a fixed alphabet our algorithm runs in time linear in the size of the trie. We also show that the position heap can be efficiently updated after addition/removal of a leaf of the input trie.