Position heaps: a simple and dynamic text indexing data structure
From MaRDI portal
Publication:533414
DOI10.1016/j.jda.2010.12.001zbMath1216.68083MaRDI QIDQ533414
Nissa Osheim, Andrzej Ehrenfeucht, Sung-Whan Woo, Ross M. McConnell
Publication date: 3 May 2011
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2010.12.001
Related Items
Online algorithms for constructing linear-size suffix trie, Linear-size suffix tries, On-line construction of position heaps, Permuted pattern matching algorithms on multi-track strings, Position heaps for Cartesian-tree matching on strings and tries, Dynamic index and LZ factorization in compressed space, Constructing LZ78 tries and position heaps in linear time for large alphabets, The parameterized suffix tray
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic extended suffix arrays
- On updating suffix tree labels
- Suffix Arrays: A New Method for On-Line String Searches
- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
- Complete inverted files for efficient text retrieval and analysis
- File structures using hashing functions