On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time (Q2384787): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 18:55, 2 February 2024

scientific article
Language Label Description Also known as
English
On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
scientific article

    Statements

    On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2007
    0 references
    GG algorithm
    0 references
    Lcharacters
    0 references

    Identifiers