A Compressed Enhanced Suffix Array Supporting Fast String Matching

DOI10.1007/978-3-642-03784-9_6MaRDI QIDQ3399127zbMATH OpenOpenAlexFDO

Authors Enno Ohlebusch, Simon Gog

Publication date 29 September 2009

Published in String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03784-9_6

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• String Processing and Information Retrieval
• New text indexing functionalities of the compressed suffix arrays
• Space efficient suffix trees

Cited in

(10)

• Algorithms to compute the Burrows-Wheeler similarity distribution
• Succincter text indexing with wildcards
• Bidirectional search in a string with wavelet trees and bidirectional matching statistics
• Using static suffix array in dynamic application: case of text compression by longest first substitution
• Alphabet-independent algorithms for finding context-sensitive repeats in linear time
• Fast matching statistics in small space
• Space-efficient parallel construction of succinct representations of suffix tree topologies
• Combined data structure for previous- and next-smaller-values
• String Processing and Information Retrieval
• Matching statistics -- a survey

This page was built for publication: A Compressed Enhanced Suffix Array Supporting Fast String Matching

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