Suffix arrays with a twist

DOI10.31577/CAI_2019_3_555zbMATH Open1518.68079WikidataQ127543977 ScholiaQ127543977MaRDI QIDQ6487692FDOQ6487692

Authors: Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson 

Publication date: 16 February 2023

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

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

zbMATH Keywords

data structureshashingsuffix arraytext indexes

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (10)

• Title not available (Why is that?)
• String Processing and Information Retrieval
• On the number of elements to reorder when updating a suffix array
• Title not available (Why is that?)
• Accessing the suffix array via \(\phi^{-1}\)-forest
• Dynamic extended suffix arrays
• An elegant algorithm for the construction of suffix arrays
• Improved characters distance sampling for online and offline text searching
• Suffix trays and suffix trists: structures for faster text indexing
• Title not available (Why is that?)

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)