Accessing the suffix array via \(\phi^{-1}\)-forest (Q6166975): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-20643-6_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4312335429 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    0 references
    0 references
    4 August 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    compressed suffix array
    0 references
    \(r\)-index
    0 references
    \(\phi\) function
    0 references
    Burrows-Wheeler transform
    0 references
    0 references