Accessing the suffix array via ^-1-forest

DOI10.1007/978-3-031-20643-6_7zbMATH Open1525.68036OpenAlexW4312335429MaRDI QIDQ6166975FDOQ6166975

Authors: Christina Boucher, Dominik Köppl, Herman Perera, Massimiliano Rossi 

Publication date: 4 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-20643-6_7

Recommendations

• New text indexing functionalities of the compressed suffix arrays
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Suffix arrays with a twist
• A categorization theorem on suffix arrays with applications to space efficient text indexes
• Suffix Arrays: A New Method for On-Line String Searches

zbMATH Keywords

Burrows-Wheeler transformcompressed suffix array\(r\)-index\(\phi\) function

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Title not available (Why is that?)
• Suffix Arrays: A New Method for On-Line String Searches
• Permuted Longest-Common-Prefix Array
• Fully functional suffix trees and optimal text searching in BWT-runs bounded space
• Title not available (Why is that?)
• Faster repetition-aware compressed suffix trees based on block trees
• Title not available (Why is that?)

This page was built for publication: Accessing the suffix array via \(\phi^{-1}\)-forest

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