On suffix extensions in suffix trees
DOI10.1016/J.TCS.2012.07.018zbMATH Open1251.68081OpenAlexW1918346263WikidataQ61609442 ScholiaQ61609442MaRDI QIDQ714837FDOQ714837
Authors: Dany Breslauer, Giuseppe F. Italiano 
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.018
Recommendations
Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Algorithms on strings (68W32)
Cites Work
- PATRICIA
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Linear work suffix array construction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal off-line detection of repetitions in a string
- Suffix Arrays: A New Method for On-Line String Searches
- A Space-Economical Suffix Tree Construction Algorithm
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- Maintaining order in a generalized linked list
- The smallest automaton recognizing the subwords of a text
- Linear time algorithms for finding and representing all the tandem repeats in a string
- On-line construction of suffix trees
- Near real-time suffix tree construction via the fringe marked ancestor problem
- Range non-overlapping indexing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transducers and repetitions
- Space efficient linear time construction of suffix arrays
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- Constructing suffix arrays in linear time
- Complete inverted files for efficient text retrieval and analysis
- On the sorting-complexity of suffix tree construction
- A four-stage algorithm for updating a Burrows-Wheeler transform
- Dynamic extended suffix arrays
- Improved dynamic dictionary matching
- Title not available (Why is that?)
- Fast incremental planarity testing
- On suffix extensions in suffix trees
- Construction of Aho Corasick automaton in linear time for integer alphabets
Cited In (12)
- Title not available (Why is that?)
- A linear time algorithm for shortest cyclic cover of strings
- Converting suffix trees into factor/suffix oracles
- On suffix extensions in suffix trees
- On suffix tree detection
- From Suffix Trees to Suffix Vectors
- The suffix tree of a tree and minimizing sequential transducers
- The Property Suffix Tree with Dynamic Properties
- Dynamic construction of an antidictionary with linear complexity
- Title not available (Why is that?)
- A suffix tree or not a suffix tree?
- On suffix tree detection
Uses Software
This page was built for publication: On suffix extensions in suffix trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714837)
