Online algorithms for constructing linear-size suffix trie
From MaRDI portal
Publication:5088922
DOI10.4230/LIPICS.CPM.2019.30OpenAlexW2964305773MaRDI QIDQ5088922FDOQ5088922
Authors: Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1901.10045
Recommendations
Cites Work
- Linear work suffix array construction
- Suffix Arrays: A New Method for On-Line String Searches
- The smallest automaton recognizing the subwords of a text
- On-line construction of compact directed acyclic word graphs
- On-line construction of suffix trees
- Near real-time suffix tree construction via the fringe marked ancestor problem
- Linear-size suffix tries
- On-line construction of position heaps
- Position heaps: a simple and dynamic text indexing data structure
- Complete inverted files for efficient text retrieval and analysis
- On the sorting-complexity of suffix tree construction
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- Alphabet-dependent string searching with wexponential search trees
- Random access to grammar-compressed strings and trees
- Title not available (Why is that?)
- Fast label extraction in the CDAWG
- Computing DAWGs and minimal absent words in linear time for integer alphabets
- Linear-size CDAWG: new repetition-aware indexing and grammar compression
- Efficient computation of substring equivalence classes with suffix arrays
Cited In (3)
This page was built for publication: Online algorithms for constructing linear-size suffix trie
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088922)
