Linear Time Suffix Array Construction Using D-Critical Substrings (Q3637104): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3138909 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Engineering a lightweight suffix array construction algorithm / 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: Linear-Time Construction of Suffix Arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4449231 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Space Efficient Linear Time Construction of Suffix Arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets / rank | |||
Normal rank |
Latest revision as of 18:56, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear Time Suffix Array Construction Using D-Critical Substrings |
scientific article |
Statements
Linear Time Suffix Array Construction Using D-Critical Substrings (English)
0 references
7 July 2009
0 references
0 references