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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00298-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088362495 / rank
 
Normal rank

Latest revision as of 10:47, 30 July 2024

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

    Statements

    Identifiers