Linear-size suffix tries
DOI10.1016/J.TCS.2016.04.002zbMATH Open1344.68057OpenAlexW2317728333WikidataQ61677829 ScholiaQ61677829MaRDI QIDQ294967FDOQ294967
Authors: Maxime Crochemore, C. Epifanio, Roberto Grossi, Filippo Mignosi 
Publication date: 16 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.002
Recommendations
Information storage and retrieval of data (68P20) Formal languages and automata (68Q45) Data structures (68P05) Algorithms on strings (68W32)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Fully compressed suffix trees
- A Space-Economical Suffix Tree Construction Algorithm
- The smallest automaton recognizing the subwords of a text
- An efficient algorithm for the all pairs suffix-prefix problem
- On-line construction of compact directed acyclic word graphs
- Average sizes of suffix trees and DAWGs
- Reducing space for index implementation.
- Near real-time suffix tree construction via the fringe marked ancestor problem
- On-line construction of position heaps
- Title not available (Why is that?)
- Title not available (Why is that?)
- New algorithms for position heaps
- Title not available (Why is that?)
- Combinatorial Pattern Matching
- Position heaps: a simple and dynamic text indexing data structure
Cited In (10)
- Online algorithms for constructing linear-size suffix trie
- Fast label extraction in the CDAWG
- On minimal and maximal suffixes of a substring
- Computing minimal and maximal suffixes of a substring
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Linear time online algorithms for constructing linear-size suffix trie
- Alphabet-dependent string searching with wexponential search trees
- Linear-size suffix tries and linear-size CDAWGs simplified and improved
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
- Linear-size CDAWG: new repetition-aware indexing and grammar compression
Uses Software
This page was built for publication: Linear-size suffix tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294967)
