Accessing the suffix array via \(\phi^{-1}\)-forest (Q6166975): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Faster repetition-aware compressed suffix trees based on block trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q6098784 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4607985 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Permuted Longest-Common-Prefix Array / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q6098794 / rank | |||
Normal rank |
Latest revision as of 12:46, 2 August 2024
scientific article; zbMATH DE number 7722476
Language | Label | Description | Also known as |
---|---|---|---|
English | Accessing the suffix array via \(\phi^{-1}\)-forest |
scientific article; zbMATH DE number 7722476 |
Statements
Accessing the suffix array via \(\phi^{-1}\)-forest (English)
0 references
4 August 2023
0 references
compressed suffix array
0 references
\(r\)-index
0 references
\(\phi\) function
0 references
Burrows-Wheeler transform
0 references