The position heap of a trie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings
Pages360-371
Number of pages12
DOIs
Publication statusPublished - Oct 22 2012
Event19th International Symposium on String Processing and Information Retrieval, SPIRE 2012 - Cartagena de Indias, Colombia
Duration: Oct 21 2012Oct 25 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7608 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Symposium on String Processing and Information Retrieval, SPIRE 2012
CountryColombia
CityCartagena de Indias
Period10/21/1210/25/12

Fingerprint

Heap
Text Indexing
Strings
Data structures
Linear Time
Data Structures
Leaves
Efficient Algorithms

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Nakashima, Y., I, T., Inenaga, S., Bannai, H., & Takeda, M. (2012). The position heap of a trie. In String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings (pp. 360-371). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7608 LNCS). https://doi.org/10.1007/978-3-642-34109-0-38

The position heap of a trie. / Nakashima, Yuto; I, Tomohiro; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. 2012. p. 360-371 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7608 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nakashima, Y, I, T, Inenaga, S, Bannai, H & Takeda, M 2012, The position heap of a trie. in String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7608 LNCS, pp. 360-371, 19th International Symposium on String Processing and Information Retrieval, SPIRE 2012, Cartagena de Indias, Colombia, 10/21/12. https://doi.org/10.1007/978-3-642-34109-0-38
Nakashima Y, I T, Inenaga S, Bannai H, Takeda M. The position heap of a trie. In String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. 2012. p. 360-371. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-34109-0-38
Nakashima, Yuto ; I, Tomohiro ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / The position heap of a trie. String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. 2012. pp. 360-371 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6faed5793bd74bd3a500b87ed2dbde89,
title = "The position heap of a trie",
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.",
author = "Yuto Nakashima and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2012",
month = "10",
day = "22",
doi = "10.1007/978-3-642-34109-0-38",
language = "English",
isbn = "9783642341083",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "360--371",
booktitle = "String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings",

}

TY - GEN

T1 - The position heap of a trie

AU - Nakashima, Yuto

AU - I, Tomohiro

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2012/10/22

Y1 - 2012/10/22

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867526977&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867526977&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-34109-0-38

DO - 10.1007/978-3-642-34109-0-38

M3 - Conference contribution

AN - SCOPUS:84867526977

SN - 9783642341083

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 360

EP - 371

BT - String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings

ER -