Suffix trays and suffix trists: structures for faster text indexing

DOI10.1007/s00453-013-9860-6zbMath1322.68058arXiv1311.1762OpenAlexW2887278666MaRDI QIDQ2354023

Moshe Lewenstein, Tsvi Kopelowitz, Richard John Cole

Publication date: 10 July 2015

Published in: Algorithmica, Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.1762

zbMATH Keywords

data structurespattern matchingindexing

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (8)

The property suffix tree with dynamic properties ⋮ Alphabet-Dependent String Searching with Wexponential Search Trees ⋮ On demand string sorting over unbounded alphabets ⋮ The parameterized suffix tray ⋮ Fast compressed self-indexes with deterministic linear-time construction ⋮ Wee LCP ⋮ Faster entropy-bounded compressed suffix trees ⋮ Fast Compressed Self-Indexes with Deterministic Linear-Time Construction

Cites Work

• Replacing suffix trees with enhanced suffix arrays
• On-line construction of suffix trees
• Near real-time suffix tree construction via the fringe marked ancestor problem
• Constructing suffix arrays in linear time
• Space efficient linear time construction of suffix arrays
• Orthogonal Range Searching for Text Indexing
• Suffix Arrays: A New Method for On-Line String Searches
• Linear work suffix array construction
• Constructing Efficient Dictionaries in Close to Sorting Time
• A Space-Economical Suffix Tree Construction Algorithm
• Automata, Languages and Programming
• On the sorting-complexity of suffix tree construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Suffix trays and suffix trists: structures for faster text indexing