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

DOI10.1007/S00453-007-9061-2MaRDI QIDQ1006380zbMATH OpenOpenAlexFDO

Authors Dong Kyue Kim, Heejin Park, 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)

Recommendations

• String Processing and Information Retrieval
• Linear-size suffix tries
• A time and space efficient data structure for string searching on large texts
• Compressed suffix trees with full functionality
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

Cites work

• scientific article; zbMATH DE number 3913713 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 1945184 (Why is no real title available?)
• scientific article; zbMATH DE number 2038766 (Why is no real title available?)
• scientific article; zbMATH DE number 1786458 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• A comparison of imperative and purely functional suffix tree constructions
• A theoretical and experimental study on the construction of suffix arrays in external memory
• A time and space efficient data structure for string searching on large texts
• Algorithms on Strings, Trees and Sequences
• An experimental study of an opportunistic index
• Better external memory suffix array construction
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Compressed suffix trees with full functionality
• Engineering a lightweight suffix array construction algorithm
• Fast lightweight suffix array construction and checking
• Faster suffix sorting
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Introduction to algorithms
• Linear-time construction of suffix arrays (extended abstract)
• On the sorting-complexity of suffix tree construction
• On-line construction of suffix trees
• Replacing suffix trees with enhanced suffix arrays
• Space efficient linear time construction of suffix arrays
• Space efficient suffix trees
• Suffix Arrays: A New Method for On-Line String Searches

Cited in

(2)

• The longest common substring problem
• String Processing and Information Retrieval

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006380)