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

DOI10.1007/S00453-007-9061-2zbMATH Open1163.68013OpenAlexW2162747936MaRDI QIDQ1006380FDOQ1006380

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

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

zbMATH Keywords

Index data structuresString algorithmsSuffix arraysSuffix trees

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

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

Cited In (2)

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

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)