On-line construction of position heaps
From MaRDI portal
Publication:396632
DOI10.1016/j.jda.2012.08.002zbMath1334.68052OpenAlexW2478332991WikidataQ58064479 ScholiaQ58064479MaRDI QIDQ396632
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.08.002
Data structures (68P05) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)
Related Items
Linear-size suffix tries ⋮ Inferring strings from position heaps in linear time ⋮ The parameterized suffix tray ⋮ Online algorithms for constructing linear-size suffix trie
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Position heaps: a simple and dynamic text indexing data structure
- The smallest automaton recognizing the subwords of a text
- Transducers and repetitions
- On-line construction of suffix trees
- Succinct Representation of Balanced Parentheses and Static Trees
- Compressed representations of sequences and full-text indexes
- Algorithms on Strings, Trees and Sequences
- File structures using hashing functions
