Suffix Arrays on Words

DOI10.1007/978-3-540-73437-6_33MaRDI QIDQ3506934zbMATH OpenOpenAlexFDO

Authors Paolo Ferragina, Johannes Fischer

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_33

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1615289
• A theoretical and experimental study on the construction of suffix arrays in external memory
• When indexing equals compression, experiments with compressing suffix arrays and applications
• Suffix trees on words
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

Cited in

(7)

• Extracting the sparse longest common prefix array from the suffix binary search tree
• Sparse and truncated suffix trees on variable-length codes
• In-place update of suffix array while recoding words
• String matching with alphabet sampling
• Inducing suffix and LCP arrays in external memory
• Finding range minima in the middle: approximations and applications
• Suffix arrays with a twist

This page was built for publication: Suffix Arrays on Words

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