Linear-time construction of two-dimensional suffix trees (Q627547): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Kun Soo Park / rank
Normal rank
 
Property / author
 
Property / author: Kun Soo Park / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9350-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089446956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional dictionary matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized pattern matching: Algorithms and applications / 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: Jewels of Stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computations under varying sets of primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818865 / 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 the construction of classes of suffix trees for square matrices: Algorithms and 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: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of suffix arrays to multi-dimensional matrices. / 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: Constructing suffix arrays in linear time / 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: 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: Linear Algorithm for Data Compression via String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank

Latest revision as of 19:27, 3 July 2024

scientific article
Language Label Description Also known as
English
Linear-time construction of two-dimensional suffix trees
scientific article

    Statements

    Linear-time construction of two-dimensional suffix trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 March 2011
    0 references
    suffix tree
    0 references
    two-dimensional suffix tree
    0 references
    divide-and-conquer approach
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers