Truncated suffix trees and their application to data compression. (Q1401392): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users 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: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / 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: Linear Algorithm for Data Compression via String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data compression via textual substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(03)00053-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975136411 / rank
 
Normal rank

Latest revision as of 10:34, 30 July 2024

scientific article
Language Label Description Also known as
English
Truncated suffix trees and their application to data compression.
scientific article

    Statements

    Identifiers