Suffix arrays with a twist

DOI10.31577/CAI_2019_3_555MaRDI QIDQ6487692zbMATH OpenWikidataFDO

Authors Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson

Publication date 16 February 2023

Published in Computing and Informatics (Search for Journal in Brave)

zbMATH Keywords

data structureshashingsuffix arraytext indexes

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1615289
• scientific article; zbMATH DE number 1998345
• String Processing and Information Retrieval
• Suffix Arrays on Words
• scientific article; zbMATH DE number 6469201

Cited in

(9)

• An elegant algorithm for the construction of suffix arrays
• Accessing the suffix array via \(\phi^{-1}\)-forest
• Dynamic extended suffix arrays
• On the number of elements to reorder when updating a suffix array
• Improved characters distance sampling for online and offline text searching
• scientific article; zbMATH DE number 1893570 (Why is no real title available?)
• scientific article; zbMATH DE number 2105038 (Why is no real title available?)
• scientific article; zbMATH DE number 2230164 (Why is no real title available?)
• String Processing and Information Retrieval

This page was built for publication: Suffix arrays with a twist

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