Time-space trade-offs for compressed suffix arrays. (Q1853020): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2768307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Storage and Retrieval by Content and Address of Static Files / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723961 / 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: Space Efficient Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank

Revision as of 11:21, 5 June 2024

scientific article
Language Label Description Also known as
English
Time-space trade-offs for compressed suffix arrays.
scientific article

    Statements

    Time-space trade-offs for compressed suffix arrays. (English)
    0 references
    0 references
    21 January 2003
    0 references
    Data structures
    0 references
    Suffix array
    0 references
    Suffix tree
    0 references

    Identifiers