On-line construction of two-dimensional suffix trees (Q5906373): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1006/jcom.1998.0495 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061870047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional dictionary matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic dictionary matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel construction of a suffix tree with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / 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: Optimal parallel suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple matching of rectangular patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Finite 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: Q3679095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking for suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional encoding by finite-state encoders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of periodicities and string-matching in real time / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:06, 28 May 2024

scientific article; zbMATH DE number 1286775
Language Label Description Also known as
English
On-line construction of two-dimensional suffix trees
scientific article; zbMATH DE number 1286775

    Statements

    On-line construction of two-dimensional suffix trees (English)
    0 references
    0 references
    0 references
    20 July 1999
    0 references
    suffix trees
    0 references
    implicit updates
    0 references

    Identifiers