Compact directed acyclic word graphs for a sliding window (Q876704): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q90345535, #quickstatements; #temporary_batch_1708298810402
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete inverted files for efficient text retrieval and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4454549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank

Revision as of 18:18, 25 June 2024

scientific article
Language Label Description Also known as
English
Compact directed acyclic word graphs for a sliding window
scientific article

    Statements

    Compact directed acyclic word graphs for a sliding window (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    author keywords: on-line text compression
    0 references
    linear-time algorithm
    0 references
    sliding window
    0 references
    compact directed acyclic word graphs
    0 references
    0 references