Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays

DOI10.1007/S00453-007-9061-2zbMath1163.68013OpenAlexW2162747936MaRDI QIDQ1006380

Heejin Park, Dong Kyue Kim, Min-Hwan Kim

Publication date: 24 March 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9061-2

zbMATH Keywords

Index data structuresString algorithmsSuffix arraysSuffix trees

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

The longest common substring problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• A time and space efficient data structure for string searching on large texts
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Engineering a lightweight suffix array construction algorithm
• On-line construction of suffix trees
• A comparison of imperative and purely functional suffix tree constructions
• Compressed suffix trees with full functionality
• Faster suffix sorting
• Space Efficient Suffix Trees
• Suffix Arrays: A New Method for On-Line String Searches
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Fast Lightweight Suffix Array Construction and Checking
• Linear-Time Construction of Suffix Arrays
• Space Efficient Linear Time Construction of Suffix Arrays
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Better external memory suffix array construction
• On the sorting-complexity of suffix tree construction
• A theoretical and experimental study on the construction of suffix arrays in external memory

This page was built for publication: Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays