On-line construction of position heaps
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4078846 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- Algorithms on Strings, Trees and Sequences
- Compressed representations of sequences and full-text indexes
- File structures using hashing functions
- On-line construction of suffix trees
- Position heaps: a simple and dynamic text indexing data structure
- Succinct representation of balanced parentheses and static trees
- The smallest automaton recognizing the subwords of a text
- Transducers and repetitions
Cited in
(9)- Online algorithms for constructing linear-size suffix trie
- Linear-size suffix tries
- Linear time online algorithms for constructing linear-size suffix trie
- Position heaps for parameterized strings
- In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses
- scientific article; zbMATH DE number 1543353 (Why is no real title available?)
- New algorithms for position heaps
- Inferring strings from position heaps in linear time
- The parameterized suffix tray
This page was built for publication: On-line construction of position heaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396632)