Improving on-line construction of two-dimensional suffix trees for square matrices (Q987807): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044405965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Suffix Tree Construction with Missing Suffix Links / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sorting-complexity of suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of the Suffix Tree to Square Matrices, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of two-dimensional suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient randomized pattern-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Construction of Two-Dimensional Suffix Trees in Linear Time / 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 two-dimensional suffix trees in \(O(n^{2} \log n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank

Latest revision as of 02:52, 3 July 2024

scientific article
Language Label Description Also known as
English
Improving on-line construction of two-dimensional suffix trees for square matrices
scientific article

    Statements

    Improving on-line construction of two-dimensional suffix trees for square matrices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    design of algorithms
    0 references
    two-dimensional suffix trees
    0 references
    index data structures
    0 references
    on-line algorithms
    0 references
    randomized algorithms
    0 references
    0 references