Accessing the suffix array via \(\phi^{-1}\)-forest

DOI10.1007/978-3-031-20643-6_7zbMath1525.68036OpenAlexW4312335429MaRDI QIDQ6166975

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster repetition-aware compressed suffix trees based on block trees
• 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

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