Succinct indexes for reporting discriminating and generic words
From MaRDI portal
Publication:501011
DOI10.1016/J.TCS.2015.06.007zbMath1330.68055OpenAlexW972680019MaRDI QIDQ501011
Rahul Shah, Sudip Biswas, Manish Patil, Sharma V. Thankachan
Publication date: 8 October 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.007
Database theory (68P15) Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Succinct data structures for flexible text retrieval systems
- Minimal Discriminating Words Problem Revisited
- Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Alphabet-Independent Compressed Text Indexing
- Space-Efficient Frameworks for Top- k String Retrieval
- A Space-Economical Suffix Tree Construction Algorithm
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Computing Discriminating and Generic Words
- Succinct Indexes for Reporting Discriminating and Generic Words
This page was built for publication: Succinct indexes for reporting discriminating and generic words
